UVA-10954 Add All

题目链接:https://vjudge.net/problem/UVA-10954

贪心法，每次选最小的两个相加就可以了

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
using namespace std;
typedef long long ll;
const int N=5000+10;
int n;
int main()
{
//freopen("/home/zlwang/C++/t2.txt","r",stdin);
while(~scanf("%d",&n)&&n)
{
int a;
priority_queue<int> q;
for(int i=0;i<n;i++)
{
scanf("%d",&a);
q.push(-a);
}
ll ans=0;
for(int i=0;i<n-1;i++)
{
int a=-q.top();q.pop();
int b=-q.top();q.pop();
ans+=a+b;
q.push(-a-b);
}
printf("%lld\n",ans);
}
return 0;
}