#include<bits/stdc++.h> using namespace std; int n; int a; priority_queue<int,vector<int>,greater<int> > q; int sum; int main() { cin>>n; for(int i=1;i<=n;i++) { cin>>a; q.push(a); } while(q.size()!=1) { int t=q.top(); q.pop(); int tt=q.top(); q.pop(); q.push(t+tt); sum+=t+tt; } cout<<sum; return 0; }