树-堆结构练习——合并果子之哈夫曼树

#include<iostream>
#include<algorithm>
#include<queue>

using namespace std;

int main()
{
ios::sync_with_stdio(false);
int n, last, sum, t;

priority_queue<int, vector<int>, greater<int> >p;///定义优先队列p；

while(cin>>n)
{
int i;
sum = 0;
for(i=0; i<n; i++)
{
cin>>t;
p.push(t);
}
while(!p.empty())
{
last = p.top();
p.pop();
if(p.empty())
break;
else
{
t = p.top();
p.pop();
last += t;
p.push(last);
sum +=last;
}
}
cout<<sum<<endl;
}
return 0;
}