(贪心(也可用优先队列))poj3253Fence Repair

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

最短的和次短的两个相加，然后将相加之和重新加入到数列中，数列中不再含有最初的最短和次短，在新的数列中再重新选出最短和次短，依次循环，直到最后只剩下一块木板

#include 
    
    
     
     
#include 
     
     
      
      
#define maxn 20010

int n;
int l[maxn];
using namespace std;
void solve()
{
    long long ans = 0;
    while(n > 1)
    {
        int min1 = 0;
        int min2 = 1;
        if(l[min1] > l[min2])
        {
            swap(min1, min2);
        }
        for(int i = 2; i < n; i++)
        {
            if(l[i] < l[min1])
            {
                //有小于最短的，则最短变次短
                min2 = min1;
                min1 = i;
            }
            else if(l[i] < l[min2])
            {
                min2 = i;
            }
        }
        int t = l[min1] + l[min2];
        ans += t;
        //这里是将最小和次小都处理掉，不用的数存在n - 1这个位置
        //若min1 = n - 1，那么t虽然存在min1这个位置，但是n - 1不被上面比较大小列入循环，也就是说是无效数字了
        //所以这里必须min1和min2替换一下
        //那么假如min2 = n - 1，可以看出min2不会进入比较大小的循环比较里面
        //所以当min1和2都不等于n - 1是，min1的位置存储t，min2的位置存储n - 1位置的数
        if(min1 == n - 1)
        {
            swap(min1, min2);
        }
        l[min1] = t;
        l[min2] = l[n - 1];
        n--;
    }
    printf("%lld\n", ans);
}
int main()
{
    while(~scanf("%d", &n))
    {
        for(int i = 0; i < n; i++)
        {
            scanf("%d", &l[i]);
        }
        solve();
    }
    return 0;
}

     
     
    
    

后期添加。使用优先队列，简化！

void solve()
{
    long long ans = 0;
    //定义由小到大的优先队列
    priority_queue<int, vector<int>, greater<int> > que;
    for(int i = 0; i < n; i++)
    {
        que.push(l[i]);
    }
    while(que.size() > 1)
    {
        int l1, l2;
        l1 = que.top();
        que.pop();
        l2 = que.top();
        que.pop();
        ans += l1 + l2;
        que.push(l1 + l2);
    }
    printf("%lld", ans);
}