#include<bits/stdc++.h> using nmaespace std; int main(){ priority_queue<int,vector,greater> ans; int n; cin>>n; int x,ans for(int i=0;i<=n-1;i++){ cin>>x; q.push(x); } while(q.size()>=2){ int a=q.top(); q.pop(); int b=q.top(); q.pop(); ans+=a+b; q.push(a+b); } printf("%d",ans); return 0;

}