求大佬，不知道错哪了，p1309瑞士轮

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
struct peo{
	int bian;
	int chu;
	int shi;
}ren[200000];
int cmd(peo a,peo b){
	if(a.chu==b.chu){
		return a.bian<b.bian;
	}
	return a.chu>b.chu;
}
int main()
{
	int n,r,q,x=0,y=0,cb,cc,cs;
	scanf("%d %d %d",&n,&r,&q);
	while(x<2*n){
		scanf("%d",&ren[x].chu);
		x++;
	}
	x=0;
	while(x<2*n){
		scanf("%d",&ren[x].shi);
		x++;
	}
	x=0;
	while(x<2*n){
		ren[x].bian=x+1;
		x++;
	}
	sort(ren,ren+2*n,cmd);
	x=0;
	while(y<r){
		while(x<=2*n-2){
			if(ren[x+1].shi>ren[x].shi){
				ren[x+1].chu++;
			}
			if(ren[x].shi>ren[x+1].shi){
				ren[x].chu++;
			}
			x=x+2;
		}
		sort(ren,ren+2*n,cmd);
		y++;
	}
	sort(ren,ren+2*n,cmd);
	printf("%d",ren[q-1].bian);
	return 0;
}