POJ 1339 poker card game G++

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <functional>
#include <queue>
using namespace std;
//英语    看博友分析   哈夫曼树
int main()
{
	int T;
	cin>>T;
	while(T--)
	{
		int n;
		scanf("%d",&n);
		priority_queue<int,vector<int>,greater<int> > pq;
		for(int i=0;i<n;i++)
		{
			int x;
			scanf("%d",&x);
			pq.push(x);
		}
		int sum=0;
		while(1)
		{
			if(pq.size()==1)
			{
				break;
			}
			int a=pq.top();
			pq.pop();
			int b=pq.top();
			pq.pop();
			//cout<<a<<" "<<b<<endl;
			int t=a+b;
			sum=t+sum;
			pq.push(t);
		}
		cout<<sum<<endl;
	}
	return 0;
}