From Evernote:

uva 10954

優先佇列水題

[sourcecode language="cpp"]
//============================================================================
// Name : Add All.cpp
// Date : 2013 2013/2/22 下午4:29:53
// Author : GCA
//============================================================================
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
typedef long long ll;
typedef unsigned int uint;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
printf("%d ",dp[htx][hty]);}Pln();}
#define M 50005
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int n;
struct cmp{
bool operator()(const int& a,const int& b){
return a>b;
}
};
int main() {
ios_base::sync_with_stdio(0);
while(~scanf("%d",&n)&&n){
priority_queue<int,vector<int>,cmp> p;
int tmp;
for(int i=0;i<n;i++){
scanf("%d",&tmp);
p.push(tmp);
}
int add[M];
int tt=0;
while(!p.empty()){
int x=p.top(),fg=0;p.pop();
int y=p.top();p.pop();
if(p.empty())fg=1;
// debug("x%d y%d\n",x,y);
add[tt++]=x+y;
p.push(x+y);
if(fg)break;

}
int ans=0;
for(int i=0;i<tt;i++){
// printf("%d\n",add[i]);
ans+=add[i];
}
printf("%d\n",ans);
// Pln();
}

}

[/sourcecode]