UVa 10954 Add All ——优先队列

用优先队列实现Huffman算法

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>

using namespace std;

int main()
{
int n, x;
while (scanf("%d", &n) == 1 && n) {
priority_queue<int, vector<int>, greater<int> > q;
for (int i = 0; i < n; i++) {
scanf("%d", &x);
q.push(x);
}
int ans = 0;
for (int i = 0; i < n - 1; i++) {
int a = q.top(); q.pop();
int b = q.top(); q.pop();
ans += a + b;
q.push((a + b));
}
printf("%d\n", ans);
}
return 0;
}