题解

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=2e5+10;
struct player{
ll s,w;
int id;
}a[N];
ll n,r,q;
bool cmp(player x,player y){
if(x.s!=y.s) return x.s>y.s;
return x.id<y.id;
}
int main(){
cin>>n>>r>>q;
for(int i=1;i<=2n;i++){
cin>>a[i].s;
a[i].id=i;
}
for(int i=1;i<=2n;i++){
cin>>a[i].w;
}
sort(a+1,a+2n+1,cmp);
for(int i=1;i<=r;i++){
for(int j=1;j<=2n;j+=2){
if(a[j].w>a[j+1].w){
a[j].s++;
}else{
a[j+1].s++;
}
}
sort(a+1,a+2*n+1,cmp);
}
cout<<a[q].id;
return 0;
}