代码如下:

#include <iostream>
#include <algorithm>
using namespace std;
#define int long long 
int n,a[10000005],Heap[10000005],ans,cnt,i;
bool cmp(int a,int b)
{
	if(a>b)
	{
		return true;
	}
	return false;
}
main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n;
	for(i=1;i<=n;++i)
	{
		cin>>a[i];
		cnt++;
		Heap[cnt]=a[i];
		push_heap(Heap+1,Heap+cnt+1,cmp);
	}
	for(i=1;i<=n-1;++i)
	{
		int min1=Heap[1];
		pop_heap(Heap+1,Heap+cnt+1,cmp);
		cnt--;
		int min2=Heap[1];
		pop_heap(Heap+1,Heap+cnt+1,cmp);
		cnt--;
		int s=min1+min2;
		ans+=s;
		Heap[++cnt]=s;
		push_heap(Heap+1,Heap+cnt+1,cmp);
	}
	return cout<<ans,0;
}