#include <iostream> #include <queue> using namespace std; priority_queue<int,vector<int>,greater<int> > q; long long ans=0; int n,m; int main() { scanf("%d",&n); for (int i=1;i<=n;++i) { scanf("%d",&m); q.push(m); } while (q.size()>1) { int tmp=0; tmp+=q.top(); q.pop(); tmp+=q.top(); q.pop(); ans+=tmp; q.push(tmp); } printf("%lld",ans); return 0; }