（贪心+优先队列）

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 Input3
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).
农夫约翰想修一小段牧场周围的篱笆。他测量了栅栏，发现他需要N（1≤N≤20000）块木板，每块木板都有一些整数长度的Li（1≤Li≤50000）单位。然后他买了一块长木板，长度刚好能锯进N块木板（即，木板的长度是长度的总和Li）。FJ忽略了“切口”，即锯切时锯屑所损失的额外长度；你也应该忽略它。 福建悲哀地意识到，他没有一个锯与削减木材，所以他大摇大摆地到农民唐的农场与这长板，礼貌地问他是否可以借用一把锯。农民唐，一个秘密资本家，不借给FJ一把锯子，而是提出向农民约翰收取木板上每一个N-1切口的费用。砍一块木头的费用正好等于它的长度。切割一块长21的木板要花21美分。 农夫唐让农夫约翰决定切割木板的顺序和地点。帮助农场主约翰确定他能花多少钱来制作木板。福建知道，他可以削减董事会在不同的顺序，这将导致不同的费用，因为产生的中间木板是不同的长度。
他想把一块21长的木板切成8、5和8长的几块。 原来的棋盘是8+5+8=21。第一次切割要花21英镑，应该用来把木板切成13和8块。第二次削减将花费13，并应用于削减13成8和5。这将花费21+13=34。如果把21分为16分和5分，那么第二次削减将花费16分，总共37分（超过34分）。

这一题解题的方法就是每次取最小的两个进行相加，把sum作为一个全新的元素插入队列中由于原队首的前2个元素已被取出，因此这两个位置被废弃，我们可以在插入操作时，利用后一个元素位置，先把队列指针p+1，使他指向第2个废弃元素的位置然后把sum从第3个位置开始向后逐一与各个元素比较，若大于该元素，则该元素前移一位，否则sum插入当前正在比较元素（队列中大于等于sum的第一个元素）的前一个位置。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
    int j,t,a[20200],i,sum=0,book[20200]={0};
    scanf("%d",&t);
    long long w=0;
    for(i=0;i<t;i++)
    {
        scanf("%d",&a[i]);
    }
     sort(a,a+t);
     for(i=0;i<t-1;i++)
     {
         sum=a[i]+a[i+1];
         w=w+sum;
         for(j=i+2;j<t;j++)
         {
             if(sum>a[j])
                a[j-1]=a[j];
             else
             {
                 a[j-1]=sum;
                 break;
             }
         }
         if(j==t)
            a[j-1]=sum;
     }
     printf("%lld\n",w);
}