7-29 修理牧场 (25 分)

题目链接

#include
#include
using namespace std;
priority_queue,greater> que;

int main(){
    int n;
    long long sum = 0;
    cin>>n;
    for(int i = 0; i < n; i++){
        int x;
        cin>>x;
        que.push(x);
    }
    while(que.size() != 1){
        int a = que.top(); que.pop();
        int b = que.top(); que.pop();
        que.push(a+b);
        sum += a+b;
    }
    cout<