hdu2527（哈夫曼编码长度+优先队列bfs）

#include <bits/stdc++.h>
const int INF = 0x3f3f3f3f;
using namespace std;
string s;
int n,ans,num[30];
void bfs(){
	int a,b;
	priority_queue<int,vector<int>,greater<int> > q;
	for(int i=0;i<26;i++){
		if(num[i]!=0)
			q.push(num[i]);
	}
	if(q.size()==1) ans=q.top();
	while(q.size() > 1){
		a=q.top();q.pop();
		b=q.top();q.pop();
		ans+=a+b;
		q.push(a+b);
	}
}

int main(){
	int k;
	cin>>n;
	while(cin>>k>>s){
		int len=s.length();
		memset(num,0,sizeof(num));
		for(int i=0;i<len;i++){
				num[s[i]-'a']++;
		}
		ans=0;
		bfs();
		if(ans<=k) cout<<"yes"<<endl;
		else cout<<"no"<<endl;
	}
}