Kminsum

#include <cstdio>
#define Mint 2000001;
using namespace std;
int idx[1000];

void kSumMinPerechi(int A[],int n,int B[],int m,int k)
{
    freopen("kminsum.out","w",stdout);
    while(k)
    {
        int i_min=0,S_min=Mint;
        for(int i=0;i<n;++i)
            if(idx[i]<m&&A[i]+B[idx[i]]<S_min)
                i_min=i,S_min=A[i]+B[idx[i]];
        printf("%d %d\n",A[i_min],B[idx[i_min]]);
        ++idx[i_min];
        --k;
    }
}

int main()
{
    int n,m,k,A[1000],B[1000];
    freopen("kminsum.in","r",stdin);
    scanf("%d%d%d",&n,&m,&k);
    for(int i=0;i<n;++i)
        scanf("%d",&A[i]);
    for(int i=0;i<m;++i)
        scanf("%d",&B[i]);
    kSumMinPerechi(A,n,B,m,k);
    return 0;
}