UVA11997

k组k个数各取1个前k小个和

简化为两个序列，一维排序，另一维取大小，在加入次大维护k个优先队列

对于多个序列，即为合成

#include<bits/stdc++.h>
#pragma GCC diagnostic error "-std=c++11"
#pragma GCC target("avx")
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
using namespace std;
struct one {
    int s,b;
    bool operator < (const one& r) const{
        return s>r.s;
    }
} aa;
void solve (int* a,int* b,int* c,int k)
{
    priority_queue<one>pq;
    for(int i=1;i<=k;++i)
    {
        aa.s=a[i]+b[1];
        aa.b=1;
        pq.push(aa);
    }
    for(int i=1;i<=k;++i)
    {
        aa=pq.top();
        c[i]=aa.s;
        pq.pop();
        if(i==k)
            continue;
        aa.s=aa.s-b[aa.b]+b[aa.b+1];
        aa.b++;
        pq.push(aa);
    }
}
int main()
{
    int k;
    int a[800];
    int b[800];
    while(~scanf("%d",&k))
    {
        for(int i=1;i<=k;++i)
        scanf("%d",&a[i]);
        sort(a+1,a+1+k);
        for(int i=1;i<k;++i)
        {
            for(int j=1;j<=k;++j)
                scanf("%d",&b[j]);
            sort(b+1,b+1+k);
            solve(a,b,a,k);
        }
        printf("%d",a[1]);
        for(int i=2;i<=k;++i)
            printf(" %d",a[i]);
        printf("\n");
    }
    return 0;
}