哈夫曼树

建立一个哈夫曼树，输出最小生成树的权值

#include<stdio.h>
#include<stdlib.h>
#include<queue>
#include<functional>//为了使greater编译通过
using namespace std;
//priority_queue<int>Q  //优先队列默认生成大根堆，
priority_queue<int,vector<int>,greater<int>>Q;//此处是小根堆


int main(){
int n;//结点个数
int i;
int weight;//权值
int a,b;
int sum=0;//权值之和
scanf("%d",&n);
while(Q.empty()==false){Q.pop();}
for(i=0;i<n;i++){
scanf("%d",&weight);
Q.push(weight);
}
while(Q.size()>1){
a=Q.top();
Q.pop();
b=Q.top();
Q.pop();
sum+=a+b;
Q.push(a+b);
}
printf("%d\n",sum);
system("pause");
return 0;
}