[BZOJ4198][哈夫曼树]NOI2015：荷马史诗

BZOJ4198

K叉哈夫曼树模板

Code：

#include<bits/stdc++.h>
#define ll long long
using namespace std;
inline ll read(){
	ll res=0,f=1;char ch=getchar();
	while(!isdigit(ch)) {if(ch=='-') f=-f;ch=getchar();}
	while(isdigit(ch)) {res=(res<<1)+(res<<3)+(ch^48);ch=getchar();}
	return res*f;
}
struct node{
	ll w;int l;
	bool operator < (const node &a) const {
		if(w^a.w) return a.w<w;
		return a.l<l;
	}
};
priority_queue<node>q;
ll ans;
int main(){
	int n=read(),k=read();
	int nn=n;
	for(int i=1;i<=n;i++){ll x=read();q.push((node){x,1});}
	if((n-1)%(k-1)) nn+=(k-1)-((n-1)%(k-1));
	for(int i=n+1;i<=nn;i++) q.push((node){0,1});
	while(nn>1){
		ll s1=0;int s2=0;
		for(int i=1;i<=k;i++){
			node x=q.top();q.pop();
			s1+=x.w;s2=max(s2,x.l);
		}
		ans+=s1;nn-=(k-1);
		q.push((node){s1,s2+1});
	}
	cout<<ans<<"\n"<<q.top().l-1;
	return 0;
}