POJ 2442 Sequence（堆的应用）

Sequence

Time Limit: 6000MS		Memory Limit: 65536K
Total Submissions: 8269		Accepted: 2705

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

    题意：有一个n*m的矩阵，要求在每一行中选取一个元素，求完n行后会得到一个和，然后题目要求输出前m小的和。

点击打开链接

#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>

using namespace std;

int sum[2001],num[2001],q[2001];
int n,m;

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&m);
        memset(sum,0,sizeof(sum));
        for(int i=0;i<m;i++)
        {
            scanf("%d",&sum[i]);
        }
        for(int i=1;i<n;i++)
        {
            memset(num,0,sizeof(num));
            sort(sum,sum+m);
            for(int j=0;j<m;j++)
            {
                scanf("%d",&num[j]);
            }
            sort(num,num+m);
            for(int j=0;j<m;j++)
            {
                q[j] = sum[0] + num[j];
            }
            make_heap(q,q+m);   ///根据已有的元素进行建堆
            printf("qian = %d    zui =   %d\n",q[0],q[m-1]);
            for(int j=1;j<m;j++)
            {
                for(int k=0;k<m;k++)
                {
                    int cnt = sum[j] + num[k];
                    if(cnt>=q[0])
                    {
                        break;
                    }
                    pop_heap(q,q+m);    ///取走根节点
                    q[m-1] = cnt;
                    printf("m-1 = %d\n",q[m-1]);
                    push_heap(q,q+m);   ///向堆中添加一个节点，并使之满足大顶堆的特性
                }
            }
            for(int j=0;j<m;j++)
            {
                sum[j] = q[j];
            }
        }
        sort(sum,sum+m);
        for(int i=0;i<m-1;i++)
        {
            printf("%d ",sum[i]);
        }
        printf("%d\n",sum[m-1]);
    }
    return 0;
}