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

最后一点wa了。