【codeup墓地】27950: 哈夫曼编码

版权声明：假装有个原创声明……虽然少许博文不属于完全原创，但也是自己辛辛苦苦总结的，转载请注明出处，感谢！ https://blog.csdn.net/m0_37454852/article/details/88536719

原题链接

#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
using namespace std;

typedef long long int LL;
const int MAX = 210, INF = 1<<30;

int N, X;

int main()
{
    while(scanf("%d", &N) != EOF && N)
    {
        priority_queue<LL, vector<LL>, greater<LL> > Q;
        LL sum = 0;
        for(int i=0; i<N; i++)
        {
            char ch;
            getchar();
            scanf("%c %d", &ch, &X);
            Q.push(X);
        }
        while(Q.size() > 1)
        {
            LL A = Q.top();
            Q.pop();
            LL B = Q.top();
            Q.pop();
            Q.push(A+B);
            sum += A+B;
        }
        printf("%lld\n", sum);
    }
	return 0;
}