uva 1197K Smallest Sums

Problem K

K Smallest Sums

You're given k arrays, each array has k integers. There are k^k ways to pick exactly one element in each array and calculate the sum of the integers. Your task is to find the k smallest sums among them.

Input

There will be several test cases. The first line of each case contains an integer k (2<=k<=750). Each of the following k lines contains k positive integers in each array. Each of these integers does not exceed 1,000,000. The input is terminated by end-of-file (EOF). The size of input file does not exceed 5MB.

Output

For each test case, print the k smallest sums, in ascending order.

Sample Input

3
1 8 5
9 2 5
10 7 6
2
1 1
1 2

Output for the Sample Input

9 10 12
2 2

 

 

本题的 关键思想是多路归并。

对k个已排序的链表或者数组，维护每一个列表首项的优先队列，依次出对即可。

在一个链表的元素被出队后，将改元素在链表中的下一个元素添加到优先队列中，依次出队。

 

注意在c++中priority_queue默认使用的是大顶堆！

 

 

#include "stdio.h"
#include <algorithm>
#include <queue>

using namespace std;

const int MAX = 750+10;

struct data
{
	int sum,x;

	data(int a, int b):sum(a),x(b){ };

	bool operator <(const data &d) const
	{
		return sum > d.sum;
	}
};

int d[MAX][MAX];

//dui yong xia biao 0 zuowei jiegduo linshi cunchu tongshi you can yu yunsuan de
//zhuyi bei fugai diao
void merge(int* x, int* y,int* c, int k)
{
	priority_queue<data> datas;
	for(int i = 0; i < k; i++)
		datas.push(data(x[0] + y[i], 0));

	for(int i = 0; i < k; i++)
	{
		data tmp = datas.top();
		datas.pop();
	    c[i] = tmp.sum;

		if(tmp.x < k)datas.push(data(c[i] - x[tmp.x] + x[tmp.x + 1], tmp.x + 1));
    }

}

int main()
{
	int k;
	while(scanf("%d",&k) != -1)
	{
		for(int i = 0; i < k; i++)
		{
			for(int j = 0; j < k; j++)
				scanf("%d",&d[i][j]);
			sort(d[i], d[i] + k);

		}


		for(int i = 1; i < k; i++)
			merge(d[i], d[0], d[0], k);

		for(int i = 0; i < k; i++)printf(i?" %d":"%d",d[0][i]);
		putchar('\n');

	}


    return 0;
}