搬水果-最小生成树-2011吉大机试

#include<iostream>
#include<queue>
#include<functional>
using namespace std;
priority_queue<int ,vector<int>,greater<int >>Q;
int main(){
int n,i,w;
cin>>n;
if(n!=0){
for(i=0;i<n;i++){
cin>>w;
Q.push(w);
}
int sum=0;
while(Q.size()>1){
int a,b;
a=Q.top();
Q.pop();
b=Q.top();
Q.pop();
sum+=a+b;
Q.push(a+b);
}
cout<<sum<<endl;
}
system ("pause");
return 0;
}