https://www.luogu.org/problemnew/show/P1309 归并排序
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
struct node{
int score,data,index;
}m[200003],w[100001],l[100001];
bool cmp(node a,node b){
if (a.score==b.score)
return a.index<b.index;
else
return a.score>b.score;
}
int main(){
int n,r,q;
cin>>n>>r>>q;
for (int i=1;i<=2*n;i++)
cin>>m[i].score,m[i].index=i;
for (int i=1;i<=n*2;i++)
cin>>m[i].data;
sort(m+1,m+2*n+1,cmp);
for (int i=1;i<=r;i++){
int win=0,lose=0;
for (int j=1;j<=2*n;j+=2){
if (m[j].data>m[j+1].data){
w[++win]=m[j];
w[win].score++;
l[++lose]=m[j+1];
}
else{
w[++win]=m[j+1];
w[win].score++;
l[++lose]=m[j];
}
}
merge(w+1,w+1+win,l+1,l+1+lose,m+1,cmp);
}
cout<<m[q].index<<endl;
return 0;
}