#include<iostream> #include<queue> #include<cstdio> using namespace std; typedef long long ll; ll n, t, ans = 0; priority_queue<ll> pq; int main(){ cin >> n; for(int i = 0; i < n; i++){ cin >> t; pq.push(-t); } while(pq.size() > 1){ ll a = -pq.top(); pq.pop(); ll b = -pq.top(); pq.pop(); ans += a + b; pq.push(-(a + b)); } cout << ans; return 0; }