SDUT3345数据结构实验之二叉树六：哈夫曼编码

#include<bits/stdc++.h>using namespace std;int main(){    char a[50];    while(~scanf("%s",a))    {        int asc2=8*strlen(a);        priority_queue<int,vector<int>,greater<int> > q;        int cou[150],lhf=0;        memset(cou,0,sizeof(cou));        for(int i=0; i<strlen(a); i++)            cou[a[i]]++;        for(int i=0; i<150; i++)            if(cou[i])                q.push(cou[i]);        while(!q.empty())        {            int m=q.top();            q.pop();            if(!q.empty())            {                int n=q.top();                q.pop();                int p=m+n;                lhf+=p;                q.push(p);            }        }        printf("%d %d %.1lf\n",asc2,lhf,(double)asc2/(double)lhf);    }}