UVa 11997 K个最小和(训练指南)

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.

#include <cstdio>
#include <queue>
#include <algorithm>
using namespace std;
const int maxn=768;
int A[maxn][maxn];
struct Item
{
    int s,b;
    Item(int s,int b):s(s),b(b) {}
    bool operator <(const Item& rhs) const
    {
        return s>rhs.s;
    }
};
///假设A和B的元素已经从小到大排好序
void merge(int* A,int* B,int* C,int n)
{
    priority_queue<Item>q;
    for(int i=0; i<n; i++)
        q.push(Item(A[i]+B[0],0));
    for(int i=0; i<n; i++)
    {
        Item item=q.top();///取出A[a]+B[b]
        q.pop();
        C[i]=item.s;
        int b=item.b;
        q.push(Item(item.s-B[b]+B[b+1],b+1));
    }
}
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        for(int i=0; i<n; i++)
        {
            for(int j=0; j<n; j++) scanf("%d",&A[i][j]);
            sort(A[i],A[i]+n);
        }
        for(int i=1; i<n; i++)///两两合并
            merge(A[0],A[i],A[0],n);
        printf("%d",A[0][0]);
        for(int i=1; i<n; i++)
            printf(" %d",A[0][i]);
        printf("\n");
    }
    return 0;
}