原题链接:https://vjudge.net/problem/UVA-10954
分类:贪心法
备注:哈夫曼树思想
#include<bits/stdc++.h>
using namespace std;
int main(void){
//freopen("in.txt","r",stdin);
int n,x;
while(~scanf("%d",&n)&&n){
priority_queue<int,vector<int>,greater<int>>pq;
for(int i=0;i<n;i++){
scanf("%d",&x);
pq.push(x);
}
int ans=0;
while(pq.size()>1){
int a=pq.top();pq.pop();
int b=pq.top();pq.pop();
ans+=(a+b); pq.push(a+b);
}
printf("%d\n",ans);
}
return 0;
}