P1309

$70pts$ 求条

#include<bits/stdc++.h>
#define int long long
using namespace std;
struct t{
   int s,w,now,id;
}a[200100];
bool cmp(t a,t b){
   if(a.now!=b.now)
   	return a.now>b.now;
   return a.id<b.id;
}
int n,r,q;
signed main(){
cin>>n>>r>>q;
for(int i=1;i<=n*2;i++){
   cin>>a[i].s;
   a[i].id=i;
   a[i].now=a[i].s;
}
for(int i=1;i<=n*2;i++)
   cin>>a[i].w;
sort(a+1,a+n*2+1,cmp);
for(int i=1;i<=r;i++){
   for(int j=1;j<=2*n;j+=2){
   	if(a[j].w>a[j+1].w)
   		a[j].now++;
   	else
   		a[j+1].now++;
   }
   sort(a+1,a+n*2+1,cmp);
}
cout<<a[q].id;
   return 0;
}