#include<cstdio>
#include<queue>
#include<vector>
#include<algorithm>
using namespace std;
priority_queue<int,vector<int>,greater<int> > pq;
int main(){
	freopen("poker.in","r",stdin);
	freopen("poker.out","w",stdout);
	int n,t,ans=0;
	scanf("%d",&n);
	for (int i=1;i<=n;i++){
		scanf("%d",&t);
		pq.push(t);
	}
	int a,b;
	while(!pq.empty()){
		a=pq.top();
		pq.pop();
		b=pq.top();
		pq.pop();
		ans=ans+a+b;
		if (pq.empty()) break;
		pq.push(a+b);
	}
	printf("%d",ans);
	return 0;
}