poj 3253 Fence Repair （STL优先队列）

版权声明：本文为博主原创文章，未经博主同意不得转载。

vasttian https://blog.csdn.net/u012860063/article/details/34805369

转载请注明出处：http://blog.csdn.net/u012860063

题目链接：http://poj.org/problem?id=3253

Description

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 L_i (1 ≤ L_i ≤ 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 L_i). 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

Sample Input

3
8
5
8

Sample Output

34

Hint

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).

Source

USACO 2006 November Gold

题意：

有一位农夫要把一个木板(长度为 N 块木板长度之和)使用 (N-1) 次锯成 N 块给定长度的小木板，每次锯都要收取一定费用，

这个费用就是当前锯的这个木板的长度,

给定各个要求的小木板的长度，及小木板的个数  N。求最小的费用；

PS：

以

3

8 5 8为例：

先锯长度为 21 的木板使其为 13 和 8 的两块木板，花费 21

再从长度为 13 的木板上锯下长度为 8 和 5 的两块木板，花费 13

总花费 ： 21 + 13 = 34

假设第一次锯下 16 和 5，第二次锯下 8 和 8 。总花费：21 + 16 = 37

思路：

要使总费用最小。那么每次仅仅选取最小长度的两块木板相加，再把这些“和”累加到总费用中就可以；

代码例如以下：

/*STL 优先队列*/
#include <cstdio>
#include <queue>
#include <vector>
#include <iostream>
using namespace std;
int main()
{
	int n;//须要分割的木板个数
	__int64 temp,a,b,mincost;
	while(~scanf("%d",&n))
	{
		//定义从小到大的优先队列，可将greater改为less。即为从大到小
		priority_queue<int, vector<int>, greater<int> > Q;
		
		while(!Q.empty())//清空队列
			Q.pop();
		
		for(int i = 1; i <= n; i++)
		{
			scanf("%I64d",&temp);
			Q.push(temp);//输入要求的木板长度（费用）并入队
		}
		
		mincost = 0;//最小费用初始为零
		
		while(Q.size() > 1)//当队列中小于等于一个元素时跳出
		{
			a = Q.top();//得到队首元素的值，并使其出队
			Q.pop();
			b = Q.top();//两次取队首。即得到最小的两个值
			Q.pop();
			Q.push(a+b);//把两个最小元素的和入队
			mincost +=a+b;
		}
		printf("%I64d
",mincost);
	}
	return 0;
}