51Nod 1117 聪明的木匠 (优先队列构造哈夫曼树)

#include<iostream>
#include<cstdio>
#include<cstring>
#include<stack>
#include<algorithm>
#include<queue>
#include<vector>
#include<cmath>
using namespace std;
int main(){
int n;
scanf("%d",&n);
priority_queue<int,vector<int> ,greater<int> > que;
for(int i=0;i<n;i++){
int num;
scanf("%d",&num);
que.push(num);
}
long long sum=0;
while(que.size()>1){
int f1=que.top();
que.pop();
int f2=que.top();
que.pop();
sum+=f1+f2;
que.push(f1+f2);
if(que.size()==1) break;
}
cout<<sum;
return 0;
}