POJ 3253 Fence Repair

POJ 3253  - Fence Repair

Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

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

大致题意：

有一个农夫要把一个木板钜成几块给定长度的小木板，每次锯都要收取一定费用，这个费用就是当前锯的这个木版的长度

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

思路：

利用哈夫曼树思想，要使总费用最小，那么每次只选取最小长度的两块木板相加，再把这些“和”累加到总费用中即可

本题虽然利用了哈夫曼树思想，但是直接用哈夫曼树做会超时。因为题意为每次选取最小长度的两块木板相加，这样我们可以每次优先选取 最小 的两个数相加，即可用优先队列。

从题目可以看出最后结果可能超出 int 整型，所以尽量用 long long 定义。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<utility>
#include<string>
#include<vector>
#include<algorithm>
#include<queue>
#include<cstdlib>
#include<cmath>
#include<stack>

using namespace std;

int main()
{
#ifndef ONLINE_JUDGE
	freopen("1.txt","r",stdin);
#endif
	int n , i , a[50005] ;
	while(cin >> n )
	{
		priority_queue<long long , vector<long long> ,greater<long long> > x ;
		for(i = 0 ; i < n ; ++i)
		{
			cin >> a[i] ;
			x.push(a[i]);
		}
		long long A , B , ans = 0 ;
		while(x.size() > 1)
		{
			A = x.top();
			x.pop();
			B = x.top();
			x.pop();

			x.push(A + B);
			ans += A + B ;
		}
		printf("%I64d\n",ans);
	}

	return 0;
}