优先队列

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    priority_queue<int,vector<int>,greater<int> >pq;
    int n,t;
    cin>>n;
    for(int i=0;i<n;++i){
        cin>>t;
        pq.push(t);
    }
    ll ans=0;
    while(pq.size()>=2){
        int a,b;
        a=pq.top(),pq.pop();
        b=pq.top(),pq.pop();
        ans+=a+b;
        pq.push(a+b);
    }
    cout<<ans<<endl;
    return 0;
}