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 needsN (1 ≤ N ≤ 20,000) planks of wood, each having some integer lengthL_i (1 ≤ L_i ≤ 50,000) units. He then purchases a single long board just long enough to saw into theN 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 theN-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 theN 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 makeN-1 cuts

Sample Input

Sample Output

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

题意：有一个农夫要把一个木板钜成几块给定长度的小木板，每一次费用就是当前锯的这个木板的长度给定小木板的个数n，各个要求的小木板的长度，，求最小费用

题中给出的数据 8 5 8，按小为优先进入队列即为5 8 8，要费用最小，即每次锯成的两块木板的长度最小（这样他们的和就最小），如题中数据，先选出5 和 8, 5+8=13，ans=ans+13, 13是倒数第一步锯木头的行为的木板长度，接着 13 8进入队列后自动以小优先排序即为 8 13，在倒数第二步的锯木头行为（在题中数据就是第一步了，因为就锯两次吗） , 8+13=21, ans=ans+21, 这样最终ans 最小取得 34

对于优先队列的定义有疑问的同学可以看看 http://www.cnblogs.com/WHLdbk/articles/5693348.html

以下是代码实现

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<cmath>
 #include<algorithm>
 #include<queue>
 #include<vector>
 using namespace std;
 int main()
 {
     priority_queue<int, vector<int>,greater<int> >q;//greater<int>以小为优先，队头小队尾大
     int n,i,j,k,a,b;__int64 num,ans;
     while(cin>>n)
     {
         ans=;
         for(i=;i<n;i++)
         {
             cin>>num;
             q.push(num);//以小为优先进队
         }
         while(q.size()>)//当队列中的元素为一时跳出循环，不过不可能为一，因为是两两出队
         {
             a=q.top();//队头元素出队
             q.pop();//队头元素消除
             b=q.top();//队头元素出队
             q.pop();//队头元素消除
             q.push(a+b);//a+b进队，自动按由队头小到队尾大的顺序拍到自己的位置
             ans+=a+b;
         }
         cout<<ans<<endl;
         while(!q.empty())
         q.pop();
     }
     return ;
 }