poj3253 Fence Repair

哈弗曼编码的裸题。。

#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
struct cmp
{
	bool operator()(long long a,long long b)
	{
		return a>b;
	}
};
int main()
{
	long long n;
	scanf("%lld",&n);
	priority_queue<long long,vector<long long>,cmp>Q;
	for(int i=0;i<n;i++)
	{
		long long tmp;
		scanf("%lld",&tmp);
		Q.push(tmp);
	}
	long long ans=0;
	while(!Q.empty())
	{
		if(Q.size()==1)
		{
			break;
		}
		long long t1=Q.top();Q.pop();
		long long t2=Q.top();Q.pop();
		ans+=t1+t2;
		Q.push(t1+t2);
	}
	printf("%lld\n",ans);
	return 0;
}