第七届山东省省赛D Swiss-system tournament（归并排序）

/* ***********************************************
Author        :devil
Created Time  :2016/6/10 14:24:16
************************************************ */
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <stdlib.h>
using namespace std;
const int N=1e5+10;
int n;
struct wq
{
    int id,score,cap;
    void push(int a,int b,int c)
    {
        id=a;
        score=b;
        cap=c;
    }
}eg[N<<1],eg1[N],eg2[N];
bool cmp(wq a,wq b)
{
    if(a.score!=b.score) return a.score>b.score;
    return a.id<b.id;
}
void fun()
{
    int l1=1,l2=1;
    for(int i=1;i<=n;i+=2)
    {
        if(eg[i].cap>eg[i+1].cap||eg[i].cap==eg[i+1].cap&&eg[i].id<eg[i+1].id)
        {
            eg1[l1++].push(eg[i].id,eg[i].score+1,eg[i].cap);
            eg2[l2++]=eg[i+1];
        }
        else
        {
            eg1[l1++].push(eg[i+1].id,eg[i+1].score+1,eg[i+1].cap);
            eg2[l2++]=eg[i];
        }
    }
    int a=1,b=1,c=1;
    while(a<l1&&b<l2)
    {
        if(eg1[a].score>eg2[b].score||eg1[a].score==eg2[b].score&&eg1[a].id<eg2[b].id)
            eg[c++]=eg1[a++];
        else eg[c++]=eg2[b++];
    }
    while(a<l1) eg[c++]=eg1[a++];
    while(b<l2) eg[c++]=eg2[b++];
}
int main()
{
    //freopen("in.txt","r",stdin);
    int t,r,q;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%d",&n,&r,&q);
        n<<=1;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&eg[i].score);
            eg[i].id=i;
        }
        for(int i=1;i<=n;i++)
            scanf("%d",&eg[i].cap);
        sort(eg+1,eg+n+1,cmp);
        while(r--)
            fun();
        printf("%d\n",eg[q].id);
    }
    return 0;
}