用队列queue解题

根据队列queue，可得：

#include <bits/stdc++.h>
using namespace std;

int n, ans = 0;

int main(){
    cin >> n;
    priority_queue<int, vector<int>, greater<int>> q;
    while (cin >> n) q.push(n);
    while (q.size() > 1){
        int a = q.top(); q.pop();
        int b = q.top(); q.pop();
        ans += a + b;
        q.push(a + b);
    }
    cout << ans;
    return 0;
}