Description
You're given k arrays, each array has k integers. There are kk 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的有序表A与B,分别在A和B中任取一个元素相加,可以得到n^2个和,我们求一下这些和中最小的的n个和。
这个问题可以转换为多路归并问题,这需要我们把这n^2个和组织成如下n个有序表。
表1:A1+B1<=A1+B2<=A1+B3<=... A1+Bn
表2:A2+B1<=A2+B2<=A2+B3<=... A2+Bn
表n:An+B1<=An+B2<=An+B3<=.... An+Bn
其中第a张表里的元素形如Aa+Bb,我们用二元组(s,b)来表示一个元素,其中s=Aa+Bb。为什么不保存A的下标a呢?因为我们用不到a的值。如果我们需要得到一个元素(s,b)在表a中的下一个元素(s',b+1),只需要计算s'=Aa+B(b+1)=Aa+Bb-Bb+B(b+1)
=s-Bb+
B(b+1),并不需要知道a是多少
#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
int A[768][768];
struct Item
{
int s,b;//s=A[a]+B[b],这里的a不重要所以不保存
Item(int s,int b):s(s),b(b){}
bool operator<(const Item&rhs)const
{
return s>rhs.s;
}
};
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;
if(b+1<n)//在我们弹出元素并且加入元素后这个优先队列的排布也在时刻变化,总保证最小的在前边
q.push(Item(item.s-B[b]+B[b+1],b+1));//加入A[a]+B[b+1]=s-B[b]+B[b+1]
}
}
int main()
{
int n;
while(cin>>n)
{
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
cin>>A[i][j];
sort(A[i],A[i]+n);//每输入一行就对其由小到大排序
}
for(int i=1;i<n;i++)
merge(A[0],A[i],A[0],n);//注意A[0]里的元素经过merge后在变化
for(int i=0;i<n;i++)
{
if(i!=n-1)
cout<<A[0][i]<<" ";
else
cout<<A[0][i]<<endl;
}
}
return 0;
}
#include <algorithm>
#include <queue>
using namespace std;
int A[768][768];
struct Item
{
int s,b;//s=A[a]+B[b],这里的a不重要所以不保存
Item(int s,int b):s(s),b(b){}
bool operator<(const Item&rhs)const
{
return s>rhs.s;
}
};
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;
if(b+1<n)//在我们弹出元素并且加入元素后这个优先队列的排布也在时刻变化,总保证最小的在前边
q.push(Item(item.s-B[b]+B[b+1],b+1));//加入A[a]+B[b+1]=s-B[b]+B[b+1]
}
}
int main()
{
int n;
while(cin>>n)
{
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
cin>>A[i][j];
sort(A[i],A[i]+n);//每输入一行就对其由小到大排序
}
for(int i=1;i<n;i++)
merge(A[0],A[i],A[0],n);//注意A[0]里的元素经过merge后在变化
for(int i=0;i<n;i++)
{
if(i!=n-1)
cout<<A[0][i]<<" ";
else
cout<<A[0][i]<<endl;
}
}
return 0;
}