#include<bits/stdc++.h> using namespace std; priority_queue<int,vector<int>,greater<int> > pq; int main(){ int n; cin>>n; for(int i=1;i<=n;i++){ int x; cin>>x; pq.push(x); } int cnt = 0; while(pq.size()>1){ int a = pq.top(); pq.pop(); int b = pq.top(); pq.pop(); pq.push(a+b); cnt+=a+b; } cout<<cnt<<'\n'; return 0; }