求哈夫曼树最小带权路径长度和代码

/*
样例输入
5
1 2 2 5 9
样例输出
37
输入可多次
*/
#include
#include
using namespace std;

priority_queue<int,vector<int>,greater<int> > Q;

int main()
{
    int n;
    int value;
    while(scanf("%d",&n)!=EOF){
            int ans = 0;
        while(Q.empty()==false) Q.pop();
        for(int i=0;iscanf("%d",&value);
            Q.push(value);
        }
        while(Q.size()>1){
            int a = Q.top();
            Q.pop();
            int b = Q.top();
            Q.pop();
            ans+=a+b;
            Q.push(a+b);
        }
        printf("%d\n",ans);
    }

    return 0;
}