POJ 3253 Fence Repair【贪心】

传送门：POJ 3253

---

Fence Repair Time Limit: 2000MS Memory Limit: 65536K

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

---

题意：
题目大意是有把一块无限长的木板锯成几块给定长度的小木板，每次锯都需要一定费用，费用就是当前锯的木板的长度。给定各个要求的小木板的长度以及小木板的个数，求最小的费用。

以要求3块长度分别为5,8,5的木板为例：先从无限长的木板上锯下长度为21的木板，花费21；再从长度为21的木板上锯下长度为5的木板，花费5；再从长度为16的木板上锯下长度为8的木板，花费8；
总花费=21+5+8=34。

思路：
题目要求我们锯木头，这里我们可以逆向思维，我们来“组”木头。即n个木块合成一个木块所需的最少费用。
我们只要每次选两个最短的木头相加，此时所花费用一定是最少的，再将这些费用加到总费用中即可，合成的木块再排序，下次还是选最短的两个，如此往复。

排序操作可以用优先队列来优化，另外数据类型需要用long long型

AC代码：

#include<iostream>
#include<algorithm>
#include<queue>
#include<cstring>
#include<stack>
#include<cstdio>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
int n;
priority_queue<int,vector<int>,greater<int> > q;//小根堆
int x;
int main()
{
  scanf("%d",&n);
  for(int i=0;i<n;i++)
  {
    scanf("%d",&x);
    q.push(x);
  }
  ll sum=0;
  if(q.size()==1)
  {
    int a=q.top();
    q.pop();
    sum+=a;
  }
  while(q.size()>1)
  {
    int a=q.top();
    q.pop();
    int b=q.top();
    q.pop();
    int t=a+b;
    sum+=t;
    q.push(t);
  }
  printf("%lld\n",sum);
  return 0;
}