60分

#include<bits/stdc++.h>
using namespace std;
unsigned long long n,a,s,neww;
int main()
{
	priority_queue<unsigned long long ,vector<unsigned long long>,greater<unsigned long long> > q;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
    	cin>>a;
    	q.push(a);
	}
	while(q.size()>1)
	{
		s+=q.top();
		neww+=q.top();
		q.pop();
		s+=q.top();
		neww+=q.top();
		q.pop();
		q.push(neww);
		neww=0;
	}
	cout<<s;
}