CodeForces Gym Trainings Season 3 Episode 5 A题

原题在此

大意就是有k组数字，每次在各组都选一个，求加在一起得到的和的前k大

可以借用k=2时的做法做

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
struct data{
	int sum,p1;
	data(){}
	data(int sum,int p1):sum(sum),p1(p1){}
	int operator<(const data& d)const{
		return sum>d.sum;
	}
};
priority_queue<data>que;
data bg;
int n,m,k,t,h[3][110],g[5];
void merge(int h1[],int g1,int h2[],int g2,int h3[],int &g3){
	bg.p1=1;g3=0;
	for(int i=1;i<=g2;++i){
		bg.sum=h1[1]+h2[i];
		que.push(bg);
	}
	for(int i=1;i<=k;++i){
		if(que.empty())break;
		data d=que.top();que.pop();
		h3[++g3]=d.sum;
		if(d.p1<g1)que.push(data(d.sum-h1[d.p1]+h1[d.p1+1],d.p1+1));
	}
	while(!que.empty())que.pop();
}
int main(){
	scanf("%d",&t);
	while(t--){
		n=m=k=0;
		memset(h,0,sizeof(h));
		memset(g,0,sizeof(g));
		scanf("%d%d",&m,&k);
		if(m==1){
			int g1;
			scanf("%d",&g1);
			for(int i=1;i<=g1;++i)
				scanf("%d",&h[1][i]);
			sort(h[1]+1,h[1]+g1+1);
			for(int i=1;i<=k&&i<=g1;++i)
				printf("%d ",h[1][i]);
		} else {
			for(int i=1;i<=2;++i){
				scanf("%d",&g[i]);
				for(int j=1;j<=g[i];++j)
					scanf("%d",&h[i][j]);
				sort(h[i]+1,h[i]+g[i]+1);
			}
			merge(h[1],g[1],h[2],g[2],h[0],g[3]);
			for(int i=3;i<=m;++i){
				memcpy(h[1],h[0],sizeof(h[1]));
				g[1]=g[3];
				scanf("%d",&g[2]);
				for(int j=1;j<=g[2];++j)
					scanf("%d",&h[2][j]);
				sort(h[2]+1,h[2]+g[2]+1);
				merge(h[1],g[1],h[2],g[2],h[0],g[3]);
			}
			for(int i=1;i<=k&&i<=g[3];++i)printf("%d ",h[0][i]);
		}
		putchar(10);
	}
}