#include<cstdio> #include<queue> long long n,ans=0; using namespace std; int main() { priority_queue<long long,vector<long long>,greater<long long> > q; scanf("%lld",&n); for(int i=1;i<=n;i++){ int s;scanf("%lld",&s);q.push(s); } for(int i=1;i<=n-1;i++) { int x=q.top();q.pop(); int y=q.top();q.pop(); ans+=x+y; q.push(x+y); } printf("%lld",ans); return 0; }