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