【哈夫曼】编码长度

hdu - 2527

#include<cstdio>
#include<iostream>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;
typedef long long int lld;
int main()
{
    int N,maxn;
    string s;
    cin>>N;
    while(N--){
        cin>>maxn>>s;
        int arr[30]={0},sum=0;
        for(int i=0;i<s.length();i++){
            arr[s[i]-'a']++;
        }
        priority_queue<int,vector<int>,greater<int> > q;
        for(int i=0;i<26;i++){
            if(arr[i]){
                q.push(arr[i]);
            }
        }
        if(q.size()==1){
            sum=q.top();
        }
        while(q.size()>1){
            int a=q.top();q.pop();
            int b=q.top();q.pop();
            q.push(a+b);
            sum+=a+b;
        }
        if(sum<=maxn) cout<<"yes"<<endl;
        else cout<<"no"<<endl;
    }
}