#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;
LL sum = 0;
priority_queue<LL, vector<LL>, greater<LL> > Q;
int main()
{
scanf("%d", &N);
for(int i=0; i<N; i++)
{
scanf("%d", &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;
}
【codeup墓地】21142: 合并果子(哈夫曼树、哈夫曼编码)
最新推荐文章于 2022-03-17 17:37:16 发布