POJ 题目2442 Sequence（技巧，优先队列）

Sequence

Time Limit: 6000MS		Memory Limit: 65536K
Total Submissions: 7687		Accepted: 2540

Description

Given m sequences, each contains n non-negative integer. Now we may select one number from each sequence to form a sequence with m integers. It's clear that we may get n ^ m this kind of sequences. Then we can calculate the sum of numbers in each sequence, and get n ^ m values. What we need is the smallest n sums. Could you help us?

Input

The first line is an integer T, which shows the number of test cases, and then T test cases follow. The first line of each case contains two integers m, n (0 < m <= 100, 0 < n <= 2000). The following m lines indicate the m sequence respectively. No integer in the sequence is greater than 10000.

Output

For each test case, print a line with the smallest n sums in increasing order, which is separated by a space.

Sample Input

1
2 3
1 2 3
2 2 3

Sample Output

3 3 4

Source

POJ Monthly,Guang Lin

ac代码

#include<stdio.h>
#include<queue>
#include<string.h>
#include<string>
#include<iostream>
using namespace std;
int a[100100];
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		int n,m,i,j;
		scanf("%d%d",&n,&m);
		priority_queue<int,vector<int>,greater<int> >p;
		priority_queue<int,vector<int>,less<int> >q;
		for(i=0;i<m;i++)
		{
			int x;
			scanf("%d",&x);
			p.push(x);
		}
		for(i=1;i<n;i++)
		{
			for(j=0;j<m;j++)
			{
				scanf("%d",&a[j]);
			}
			while(!p.empty())
			{
				int sum=p.top();
				p.pop();
				for(j=0;j<m;j++)
				{
					if(q.size()==m)
					{
						if(sum+a[j]<q.top())
						{
							q.pop();
							q.push(sum+a[j]);
						}	
					}
					else
					{
						if(q.size()<m)
							q.push(sum+a[j]);
					}
				}
			}
			while(!q.empty())
			{
				p.push(q.top());
				q.pop();
			}
		}
		printf("%d",p.top());
		p.pop();
		for(i=1;i<m;i++)
		{
			printf(" %d",p.top());
			p.pop();
		}
		printf("\n");
	}
}