POJ 3253Fence Repair(哈夫曼&優先隊列)

Fence Repair Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 21545 Accepted: 6875

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

Output

Sample Input

3
8
5
8

Sample Output

34

Hint

#include
#include
#include
#include
using namespace std;
long long a[20002];

int main()
{
    int n,i;
    long long res,tmp;
    while (cin >> n)
    {
        for (i = 0; i < n; i++)
            scanf("%I64d",&a[i]);

        int t = 0;

        res=0;
        sort(a,a+n);

        while (t < n)
        {
            tmp = a[t] + a[t+1];
            if(t==n-2)
            {
                res += tmp;
                break;
            }

            for(i=t+2;i




使用STL priority_queue代碼：
#include
#include
#include
#include
#include
typedef long long ll;
using namespace std;

priority_queue ,greater > mq;

int main()
{
    int n,i;
    ll res,tmp,p1,p2;
    while(cin>>n)
    {
        res=0;
        while(!mq.empty())   //先清空
            mq.pop();
        while(n--)
        {
            scanf("%lld",&tmp);
            mq.push(tmp);
        }

        while(mq.size()>1)
        {
            p1=mq.top(); mq.pop();
            p2=mq.top(); mq.pop();
            res+=p1+p2;
            mq.push(p1+p2);
        }
        cout<