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

#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
#include <cstdio>
using namespace std;
int main() {
    char s[1000+5];
    int vis[150+5];
    while(~scanf("%s", s)) {
        memset(vis,0,sizeof(vis));
        int n=strlen(s);
        for(int i=0;i<n;i++)
            vis[(int)s[i]]++;
        int q[10000+5];
        int head=0, tail=0;
        for(int i=0;i<150;i++)
            if(vis[i])
                q[tail++]=vis[i];
        int ans=0;
        while(head<tail) {
            sort(q+head,q+tail);
            int x1=q[head];
            head++;
            if(head<tail) {
                int x2=q[head];
                head++;
                ans+=x1+x2;
                q[tail++]=x1+x2;
            }
        }
        printf("%d %d %.1lf\n", 8*n, ans, 8*n*1.0/ans);
    }
    return 0;
}



#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
#include <cstdio>
using namespace std;
int main() {
    char s[1000+5];
    int vis[150+5];
    while(~scanf("%s", s)) {
        memset(vis,0,sizeof(vis));
        int n=strlen(s);
        for(int i=0;i<n;i++)
            vis[(int)s[i]]++;
        priority_queue<int, vector<int >, greater<int > >q;
        for(int i=0;i<150;i++)
            if(vis[i])
                q.push(vis[i]);
        int ans=0;
        while(!q.empty()) {
            int x1=q.top();
            q.pop();
            if(!q.empty()) {
                int x2=q.top();
                q.pop();
                ans+=x1+x2;
                q.push(x1+x2);
            }
        }
        printf("%d %d %.1lf\n", 8*n, ans, 8*n*1.0/ans);
    }
    return 0;
}