题解 | #搬水果#

#include <iostream>
#include <cstdio>
#include <queue>

using namespace std;

/**
 * 搬水果--吉林大学
 * @return
 */
int main() {
    priority_queue<int, vector<int>, greater<int>> priorityQueue;
    int fruitCategory;
    while (cin >> fruitCategory) {
        if (fruitCategory == 0) {
            break;
        }
        for (int i = 0; i < fruitCategory; ++i) {
            int fruitNum;
            cin >> fruitNum;
            priorityQueue.push(fruitNum);
        }
        int ans = 0;
        while (priorityQueue.size() >= 2) {
            int x = priorityQueue.top();
            priorityQueue.pop();
            int y = priorityQueue.top();
            priorityQueue.pop();
            ans += x + y;
            priorityQueue.push(x + y);
        }
        cout << ans << endl;
    }
    return 0;
}