#include<bits/stdc++.h>
using namespace std;
priority_queue <int,vector<int>, greater<int> > q;
int n,num,ans;
int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&n);
        q.push(num);
    }
    for(int i=1;i<n;i++){
        int x=q.top();
        ans+=x;
        q.pop();
        int y=q.top();
        ans+=y;
        q.pop();
        q.push(x+y);
    }
    cout<<ans<<'\n';
    return 0;
}

全WA，0分