BZOJ 4198: [Noi2015]荷马史诗 哈夫曼树 k叉哈夫曼树

https://www.lydsy.com/JudgeOnline/problem.php?id=4198

https://blog.csdn.net/chn_jz/article/details/76695514

k叉需要通过补0来填满树。顺便复习一下重载运算符，别忘了优先队列的比较是反的。。

 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<cmath>
 #include<iostream>
 #include<queue>
 using namespace std;
 #define LL long long
 LL n,k;
 struct nod{
     LL x,d;
     bool operator<(const nod &z)const{
         if(z.x==x)return d>z.d;
         return x>z.x;
     }
 };
 priority_queue< nod >q;
 int main(){
     nod v;v.d=;
     scanf("%lld%lld",&n,&k);
     for(int i=;i<=n;i++){scanf("%lld",&v.x);q.push(v);}
     LL ans=,ans1=,zz,zz1;bool f=;
     if(k>){
         while(n%(k-)!=){
             ++n;v.x=;q.push(v);
         }
     }
     while(!q.empty()){
         zz=;zz1=;
         for(int i=;i<=k;i++){
             if(q.empty()){f=;break;}
             v=q.top();q.pop();
             zz+=v.x;zz1=max(zz1,v.d);
         }
         if(f)break;
         ans+=zz; v.x=zz; v.d=zz1+;
         ans1=max(zz1+,ans1);
         q.push(v);
     }
     printf("%lld\n%lld\n",ans,ans1);
     return ;
 }