哈夫曼树---POJ3253

 1 #include<queue>
 2 #include<stdio.h>
 3 using namespace std;
 4 int main()
 5 {
 6     long long int sum;
 7     int i,n,t,a,b;
 8     while(~scanf("%d",&n))
 9     {
10         priority_queue<int,vector<int>,greater<int> >q;
11         for(i=0; i<n; i++)
12         {
13             scanf("%d",&t);
14             q.push(t);
15         }
16         sum=0;
17         if(q.size()==1)
18         {
19             a=q.top();
20             sum+=a;
21             q.pop();
22         }
23         while(q.size()>1)
24         {
25             a=q.top();
26             q.pop();
27             b=q.top();
28             q.pop();
29             t=a+b;
30             sum+=t;
31             q.push(t);
32         }
33         printf("%lld\n",sum);
34     }
35     return 0;
36 }