UVA 11997 K Smallest Sums --最小堆

 K Smallest Sums

Time Limit:1000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu

      UVA 11997

Description

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

---

Rujia Liu's Present 3: A Data Structure Contest Celebrating the 100th Anniversary of Tsinghua University
Special Thanks: Yiming Li
Note: Please make sure to test your program with the gift I/O files before submitting!

 

 

 

题意：给你n行数字，每行有n 个数字，让你从每行中各取一个数，计算他们的和，然后输出和最小的k个和。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<queue>
using namespace std;
int  a[800][800],k;
struct node
{
    int s,b;//s数值，b记录每一行的游标，也就是指当前加上的是当前行的第几列。
    bool operator < (const node &a) const//重载运算符，让node可以进行 < 运算。
    {
        return s>a.s;
    }
};
void merge(int *A,int *B,int *C,int n)
{
    node tmp;
    priority_queue<node> q;
    for(int i=0;i<n;i++)//拿第一行的每个数和剩下k-1行的首元素依次相加。
    {
        tmp.s=A[i]+B[0];
		tmp.b=0;
        q.push(tmp);
    }
    for(int i=0;i<n;i++)//更新a[0]，保证a[0]里面一直是最小的n个数。
    {
        tmp=q.top();
        q.pop();
        C[i]=tmp.s;//每一行的首元素相加，必定是最小的。
        if(tmp.b+1<n)
        {
            tmp.s=tmp.s-B[tmp.b]+B[tmp.b+1];//然后依次判断A[2]+B[1],A[1]+B[2]...的大小，取较小的，下一步让游标依次向右走。直到找够n个数。
            tmp.b++;
            q.push(tmp);
        }
    }
}
int main()
{
    while(~scanf("%d",&k))
    {
        for(int i=0;i<k;i++)
        {
            for(int j=0;j<k;j++)
                scanf("%d",&a[i][j]);
            sort(a[i],a[i]+k);
        }
        for(int i=1;i<k;i++)
            merge(a[0],a[i],a[0],k);
        for(int i=0;i<k;i++){
            printf("%d",a[0][i]);
			if(i<k-1)printf(" ");
			else	printf("\n");
		}
    }
    return 0;
}