Interclasari

#include <iostream>
#include <queue>
using namespace std;
priority_queue<int> Q;

int main()
{
    int i,x,y,n,sol=0;
    cin>>n;
    for(i=1;i<=n;++i)
        cin>>x,Q.push(-x);
    while(--n)
    {
        x=-Q.top();
        Q.pop();
        y=-Q.top();
        Q.pop();
        x+=y;
        sol+=x;
        Q.push(-x);
    }
    cout<<sol;
    return 0;
}