记录

#include<bits/stdc++.h>
using namespace std;
struct xuanshou{
	int sl,fs,bh;
};
bool comp(xuanshou a,xuanshou b){
	if(a.fs==b.fs)return a.bh<b.bh;
	return a.fs>b.fs;
}
int main(){
	int n,r,q;
	cin>>n>>r>>q;
	xuanshou a[2*n];
	for(int i=0;i<2*n;i++){
		cin>>a[i].fs;
		a[i].bh=i+1;
	}
	for(int i=0;i<2*n;i++)cin>>a[i].sl;
	sort(a,a+2*n,comp);
	int i=1;
	while(i<=r){
		for(int j=0;j<2*n;j+=2){
			if(a[j].sl<a[j+1].sl)
				a[j+1].fs++;
			else
				a[j].fs++;
		}
		sort(a,a+2*n,comp);
		i++;
	}
	cout<<a[q-1].bh;
	return 0;
}