很简单的一道题目,考察的是huffman树,然而这个题目更简单,不需要建树,直接利用优先队列来进行处理,最后输出最终的结果就可以了,具体实现见如下代码:
#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<deque>
#include<functional>
using namespace std;
int main(){
int N;
while (cin >> N){
if (N == 0) break;
priority_queue<int, vector<int>, greater<int>> pq;
for (int i = 0; i < N; i++){
int t;
cin >> t;
pq.push(t);
}
int ans = 0;
for (int i = 0; i < N - 1; i++)
{
int a = pq.top();
pq.pop();
int b = pq.top();
pq.pop();
ans += a + b;
pq.push(a+b);
}
cout << ans << endl;
}
return 0;
}