题目1172：哈夫曼树.cpp

#include<stdio.h>
#include<queue>
using namespace std;
//在“<<”中加一个空格即可!!!!!!!


priority_queue<int,vector<int>,greater<int> > Q;
int main()
{
	int n;
	
	while(scanf("%d",&n)!=EOF)
	{
		while(Q.empty()==false)
		{
			Q.pop();
		}
		for(int i=0;i<n;i++)
		{
			int x;
			scanf("%d",&x);
			Q.push(x);
		
		}
		int ans=0;
		while(Q.size()>1)
		{
			int a=Q.top();
			Q.pop();
			int b=Q.top();
			Q.pop();
			ans+=(a+b);
			Q.push(a+b);

		}
	
		printf("%d\n",ans);

	}
return 0;
}