UVA 10954 Add All (贪心 ＋ 优先队列）

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个数。两个数字相加的代价为他们的和。要求出计算完成最小的代价。。

思路：贪心。每次都挑选最小的两个数相加。代价会是最小的。然后把他们的和替代掉他们两个。。可以用优先队列解决。

代码：

#include <stdio.h>
#include <string.h>
#include <queue>
#include <algorithm>
using namespace std;

int n, sum;
struct Num {
    int num;
    bool operator < (const Num a) const {//重载<改变优先级判定
	return num > a.num;
    }
} q;
priority_queue<Num> Q;

int main() {
    while (~scanf("%d", &n) && n) {
	sum = 0;
	for (int i = 0; i < n; i ++) {
	    scanf("%d", &q.num);
	    Q.push(q);
	}
	while (!Q.empty()) {
	    int he = 0;
	    he += Q.top().num; Q.pop();
	    he += Q.top().num; Q.pop();
	    sum += he;
	    if (!Q.empty()) {//如果只剩下最后两个元素。就不用在入队了。。
		q.num = he; 
		Q.push(q);
	    }
	}
	printf("%d\n", sum);
    }
    return 0;
}