POJ 3253 Fence Repair(优先队列+思维贪心)(哈夫曼树算法)

Farmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needs N (1 ≤ N ≤ 20,000) planks of wood, each having some integer length Li (1 ≤ Li ≤ 50,000) units. He then purchases a single long board just long enough to saw into the N planks (i.e., whose length is the sum of the lengths Li). FJ is ignoring the "kerf", the extra length lost to sawdust when a sawcut is made; you should ignore it, too.
FJ sadly realizes that he doesn't own a saw with which to cut the wood, so he mosies over to Farmer Don's Farm with this long board and politely asks if he may borrow a saw.
Farmer Don, a closet capitalist, doesn't lend FJ a saw but instead offers to charge Farmer John for each of the N-1 cuts in the plank. The charge to cut a piece of wood is exactly equal to its length. Cutting a plank of length 21 costs 21 cents.

Farmer Don then lets Farmer John decide the order and locations to cut the plank. Help Farmer John determine the minimum amount of money he can spend to create the N planks. FJ knows that he can cut the board in various different orders which will result in different charges since the resulting intermediate planks are of different lengths.

Input

Line 1: One integer N, the number of planks 
Lines 2.. N+1: Each line contains a single integer describing the length of a needed plank

Output

Line 1: One integer: the minimum amount of money he must spend to make N-1 cuts

Simple Input

3

8

5

8

Simple Output

34

Hit

He wants to cut a board of length 21 into pieces of lengths 8, 5, and 8. 
The original board measures 8+5+8=21. The first cut will cost 21, and should be used to cut the board into pieces measuring 13 and 8. The second cut will cost 13, and should be used to cut the 13 into 8 and 5. This would cost 21+13=34. If the 21 was cut into 16 and 5 instead, the second cut would cost 16 for a total of 37 (which is more than 34).

具体题意就是说：每砍一次树花费的钱数就是砍成的两端树的长度总和（其实就是被砍的树的长度），问最小花费是多少？

刚开始的解题思路很容易想成每次砍最大的那一节，就能使下次加的花费最少。但是我们会发现，如果某次可以一刀切出两段需要的长度来，岂不是有可能使总花费更小。

这里有一个哈夫曼算法，因为本来我们就不知道怎么切第一刀，因为后面需要的切法无法预料，所以干脆倒过来，把需要的木材一个个拼起来，怎么拼呢？

我们每次拼接都使费用最小，即把最短的两段拼接起来，直到只剩下一根木材为止（这里用优先队列维护产生最小量）。

这样得到的花费不就是最小的嘛！

附上代码：

#include<cstdio>
#include<iostream>
#include<cstring>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;

int main()
{
	priority_queue<int, vector<int>, greater<int> > q;
	
	int n;
	int t;
	ll ans = 0;
	cin>>n;
	
	for(int i = 1;i<= n;i++)
	{
		scanf("%d",&t);
		q.push(t);
	}
	
	int a,b;
	while(q.size()> 1)
	{
		a = q.top();
		q.pop();
		b = q.top();
		q.pop();
		q.push(a+b);
		ans+= (a+b);
	}
	
	cout<<ans<<endl;
	return 0;
}

加加油！