哈夫曼树（优先队列实现）

#include<iostream>
#include<cstdio>
#include<queue>

using namespace std;


int main(){
    int t;
    cin>>t;
    while(t--)
{
    priority_queue<long long ,vector<long long >,greater<long long > > q;
    int n;
    cin>>n;
    //scanf("%d",&n);
    long long temp;long long ans = 0;
    for(int i = 0 ; i < n; i ++)
    {
        scanf("%lld",&temp);
        q.push(temp);
    }
    while(q.size()>1)
    {
        long long  x = q.top();
        q.pop();
        long long  y = q.top();
        q.pop();
        q.push(x+y);
        ans +=x+y;
    }
    printf("%lld\n",ans);

}
   return 0;
}