题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2527
这题跟1053简直一模一样。
故不再赘述
下面是AC代码:
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<sstream>
#include<fstream>
#include<vector>
#include<map>
#include<stack>
#include<list>
#include<set>
#include<queue>
#define LL long long
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1 | 1
using namespace std;
const int maxn=105,inf=1<<29;
int dir[][2]={ {0,1},{-1,0},{0,-1},{1,0},{-1,1},{-1,-1},{1,-1},{1,1}};
int n,m,t;
int a[maxn];
struct node
{
int w;
friend bool operator <(node x,node y)
{
return x.w>y.w;
}
};
int main()
{
cin>>t;
while(t--)
{
string s;
while(cin>>n>>s)
{
priority_queue<node>q;
node t,aa,bb;
memset(a,0,sizeof(a));
for(int i=0;i<s.size();i++) a[s[i]-'a']++;
for(int i=0;i<26;i++)
{
t.w=a[i];
if(t.w) q.push(t);
}
int ans=0;
if(q.size()==1) ans=s.size();
else
{
while(q.size()>1)
{
aa=q.top();q.pop();
bb=q.top();q.pop();
int sum=aa.w+bb.w;
ans+=sum;
t.w=sum;
q.push(t);
}
}
if(ans<=n) cout<<"yes"<<endl;
else cout<<"no"<<endl;
}
}
return 0;
}