Gym - 101128C：Canvas Painting

这个就是哈夫曼树哇~

我们仨英语太差了，跟榜时候才看出来是哈夫曼树雾

一个优先队列就可以搞定

 #include <cstdio>
 #include <algorithm>
 #include <cstring>
 #include <iostream>
 #include <queue>
 using namespace std;
 typedef long long LL;
 int T;
 const int maxn=+;
 LL a[maxn];
 LL n;
 int main(){
     scanf("%d",&T);
     for(int t=;t<=T;t++){
         priority_queue<LL,vector<LL>,greater<LL> >q;
         LL ans=;
         scanf("%lld",&n);
         for(int i=;i<=n;i++){
             scanf("%d",&a[i]);
             q.push(a[i]);
         }
         while(q.size()>=){
             LL a=q.top();q.pop();
             LL b=q.top();q.pop();
             ans+=a+b;
             q.push(a+b);
         }
       cout<<ans<<endl;
     }

 return ;
 }