Poj3253—Fence Repair

原文地址      http://poj.org/problem?id=3253

Fence Repair

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 33844		Accepted: 10881

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

这是huffman思想的应用，其实就是贪心的方法

因为用朴素的huffman思想会超时，所以我们用到了最小优先队列

下面讲一下最小优先队列：

使用方法比较简单，模板声明参数有三个  priority_queue<Type, Container, Functional>

Type 为数据类型， Container 为保存数据的容器，Functional 为元素比较方式。
Container 必须是用数组实现的容器，比如 vector, deque 但不能用 list.
STL里面容器默认用的是 vector. 比较方式默认用 operator< , 所以如果你把后面俩个参数 缺省的话，优先队列就是大顶堆，队头元素最大

1.     priority_queue<int,vector<int>,less<int> >q;//使用priority_queue<int> q1;一样  

如果要用到小顶堆，则一般要把模板的三个参数都带进去。
STL里面定义了一个仿函数 greater<>，对于基本类型可以用这个仿函数声明小顶堆

      2.      priority_queue<int,vector<int>,greater<int> >q;  

对于自定义类型，则必须自己重载 operator< 或者自己写仿函数先看看例子:

     

下面是此题代码

#include <iostream>
#include <vector>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <queue>
using namespace std;
int main()
{
    int planknumber;
    while(~scanf("%d",&planknumber))
    {
        int length;
        priority_queue<int,vector<int>,greater<int> > l;
        while(planknumber--)
        {
            scanf("%d",&length);
            l.push(length);
        }
        long long int totallength=0;
        long long int temporary=0;
        while(l.size()>1)
        {
            int temp1=l.top();
            l.pop();
            int temp2=l.top();
            l.pop();
            temporary=temp1+temp2;
            totallength+=temporary;
            l.push(temporary);
        }
        printf("%lld\n",totallength);
    }
    return 0;
}