题解

很简单

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

int main(){
    priority_queue<ll,vector<ll>,greater<ll>>que;
    ll n; cin >> n;
    for(ll i = 1; i <= n; i++){
        ll x; cin >> x;
        que.push(x);
    }
    ll sum = 0;
    for(ll i = 1; i < n; i++){
        ll a = que.top();que.pop();
        ll b = que.top();que.pop();
        sum += a+b;
        que.push(a+b);
    }
    cout << sum << "\n";
    return 0;
}