问题 C: 合并果子

#include<bits/stdc++.h>
using namespace std;
 
int main()
{
    int n;
    scanf("%d", &n);
 
    priority_queue<int, vector<int>, greater<int>> heap;
    while (n--)
    {
        int x;
        scanf("%d", &x);
        heap.push(x);
    }
 
    int res = 0;
    while (heap.size() > 1)
    { //取出最小的两个元素
        int a = heap.top(); heap.pop();
        int b = heap.top(); heap.pop();
        res += a + b;
        heap.push(a + b);//将它们的和入队
    }
 
    printf("%d\n", res);
    return 0;
}