维护一个最大堆,堆里面的就是所求前k个最小值
#include <iostream>
#include <stdio.h>
#include <queue>
#include <algorithm>
using namespace std;
int a[2100];
int b[2100];
int main()
{
int t;
scanf("%d", &t);
int m, n;
int i, j, k;
int g;
priority_queue<int, vector<int>, less<int> >q;
while(t--){
scanf("%d %d", &m, &n);
for(i = 0;i < n;i++){
scanf("%d", &a[i]);
}
for(i = 1;i < m;i++){
g = 0;
sort(a,a+n);
for(j = 0;j < n;j++){
scanf("%d", &b[j]);
}
sort(b,b+n);
for(j = 0;j < n;j++){
q.push(a[j]+b[0]);
}
for(j = 1;j < n;j++){
for(k = 0;k < n;k++){
if(b[j]+a[k] > q.top()){
break;
}
q.pop();
q.push(b[j]+a[k]);
}
}
while(!q.empty()){
a[g++] = q.top();
q.pop();
}
}
sort(a,a+n);
for(i = 0;i < n;i++){
if(i == 0) printf("%d", a[i]);
else printf(" %d", a[i]);
}
printf("\n");
}
return 0;
}