【高效程序设计——贪心】UVa 10954 优先队列

Add All

Time Limit: 3000MS

Memory Limit: Unknown

64bit IO Format: %lld & %llu

Submit Status

Description

Problem F
Add All
Input: standard input
Output: standard output

Yup!! The problem name reflects your task; just add a set of numbers. But you may feel yourselves condescended, to write a C/C++ program just to add a set of numbers. Such a problem will simply question your erudition. So, let’s add some flavor of ingenuity to it.

 

Addition operation requires cost now, and the cost is the summation of those two to be added. So, to add 1 and 10, you need a cost of 11. If you want to add 1, 2 and 3. There are several ways –

 

1 + 2 = 3, cost = 3 3 + 3 = 6, cost = 6 Total = 9

1 + 3 = 4, cost = 4 2 + 4 = 6, cost = 6 Total = 10

2 + 3 = 5, cost = 5 1 + 5 = 6, cost = 6 Total = 11

 

I hope you have understood already your mission, to add a set of integers so that the cost is minimal.

 

Input

Each test case will start with a positive number, N (2 ≤ N ≤ 5000) followed by N positive integers (all are less than 100000). Input is terminated by a case where the value of N is zero. This case should not be processed.

 

Output

For each case print the minimum total cost of addition in a single line.

 

Sample Input                           Output for Sample Input

3 1 2 3 4 1 2 3 4 0

9 19

题意：给定n个数，将n个数任选两个数出来相加，加好之后放回数堆，直到只剩一个数为止，每次相加操作的消耗为两数之和，问能够把数加到只剩一个的最少的消耗为多少

思路：不难看出来这是Huffman的变体，根据贪心策略，我们每次取出最小的两个数相加，直到剩余一个数为止，这里直接使用优先队列即可

代码如下：

/*
	Author : _L
*/
#include<cstdio>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<cstdlib>
#include<ctime>
#include<iostream>
#include<sstream>
#include<fstream>
#include<algorithm>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<deque>
#include<set>
#include<map>
#include<string>
#include<bitset>
#include<functional>
#include<utility>

using namespace std;

typedef long long ll;
inline bool get(int &t)
{
    bool flag = 0 ;
    char c;
    while(!isdigit(c = getchar())&&c!='-') if( c == -1 ) break ;
    if( c == -1 ) return 0 ;
    if(c=='-') flag = 1 , t = 0 ;
    else t = c ^ 48;
    while(isdigit(c = getchar()))    t = (t << 1) + (t << 3) + (c ^ 48) ;
    if(flag) t = -t ;
    return 1 ;
}
const int maxn=5000+50;
//ll A[maxn];
int m,n;
bool flag;
bool cmp(const int &t1,const int &t2)
{
    return t1>t2;
}
priority_queue<int,vector<int>,greater<int> > Q;

int main()
{
    int i,j,k,tt,sum,cnt,a,b,len;
    ll ans;
    while(~scanf("%d",&n) && n)
    {
        ans=0;
        for(i=0;i<n;i++)
        {
            scanf("%d",&tt);
            Q.push(tt);
        }
        while(Q.size()>1)
        {
            a=Q.top();Q.pop();
            b=Q.top();Q.pop();
            a=a+b;
            ans+=a;
            Q.push(a);
        }
        //ans+=Q.top();
        Q.pop();
        printf("%lld\n",ans);

    }

    return 0;
}