poj2442---Sequence

Sequence

Time Limit: 6000MS		Memory Limit: 65536K
Total Submissions: 8342		Accepted: 2732

给一个m*n的矩阵；从每行选出一个求前m小的元素；（矩阵元素可重复使用）

思路：一致保持前m小；

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

#include <iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<stack>
#include<cmath>
#include<algorithm>
#include<map>
#include<string>
using namespace std;
int a[2010];
int main()
{
    int t,n,m,x;
    while(~scanf("%d",&t))
    {
        while(t--)
        {
            priority_queue<int>Q;
            scanf("%d%d",&n,&m);
            for(int i=0; i<n; i++)
            {
                if(i==0)
                {
                    for(int j=0; j<m; j++)
                    {
                        scanf("%d",&x);
                        Q.push(x);
                    }
                }
                else
                {
                    for(int j=0; j<m; j++)
                    {
                        a[j]=Q.top();
                        Q.pop();
                    }
                    for(int j=0; j<m; j++)
                    {
                        scanf("%d",&x);
                        for(int k=m-1; k>=0; k--)
                        {
                            if(j==0)
                            {
                                Q.push(x+a[k]);

                            }
                            else
                            {
                                if(x+a[k]<=Q.top())
                                    {
                                        Q.push(x+a[k]);
                                        Q.pop();
                                    }
                                    else
                                        break;
                            }
                        }
                    }
                }
            }
            for(int i=0; i<m; i++)
            {
                a[i]=Q.top();
                Q.pop();
            }
            for(int i=m-1; i>=0; i--)
            {
                printf("%d",a[i]);
                if(i!=0)
                    printf(" ");
                else
                    printf("\n");
            }
        }
    }
    return 0;
}