Add All +uva+贪心

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

解决方案：一开始思路就有点错了，要先加最小的那两个，然后这两个数就替换成了两者之和，再从新的数组里寻找两个最小的。

如果每次都对新的数组排序的话，肯定会超时，所以可用优先队列。

代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#define MMAX 100003
using namespace std;
int n;
struct node{
int n;
bool operator <(const node &a )const {
    return n>a.n;
}
};///要用优先队列，就要重载<运算符。

int main(){
    while(~scanf("%d",&n)&&n){
    priority_queue<node> Q;
        for(int i=0;i<n;i++){
            node num;
            scanf("%d",&num.n);
            Q.push(num);
        }
        long long sum=0;
        while(1){
            if(Q.size()==1) break;
            node a,b;
            a=Q.top();
            Q.pop();
            b=Q.top();
            Q.pop();
            sum+=a.n+b.n;
           // cout<<a.n<<" "<<b.n<<endl;
            a.n+=b.n;
            Q.push(a);
            }

        cout<<sum<<endl;
    }

    return 0;}