题目描述 https://www.luogu.org/problemnew/show/P1309
简单的sort会超时,需要两个数组分别记录获胜者和失败者,这样分数依然单调,最后再合在一起。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=2e5+5;
int n,r,q,sc[N],w[N],a[N],win[N],lose[N];
bool cmp(int a,int b)
{
if(sc[a]!=sc[b]) return sc[a]>sc[b];
return a<b;
}
void merge()
{
int i=1,j=1;
a[0]=0;
while(i<=win[0]&&j<=lose[0])
if(cmp(win[i],lose[j])) a[++a[0]]=win[i++];
else a[++a[0]]=lose[j++];
while(i<=win[0]) a[++a[0]]=win[i++];
while(j<=lose[0]) a[++a[0]]=lose[j++];
}
int main()
{
scanf("%d%d%d",&n,&r,&q); n*=2;
for(int i=1;i<=n;i++) a[i]=i;
for(int i=1;i<=n;i++) scanf("%d",&sc[i]);
for(int i=1;i<=n;i++) scanf("%d",&w[i]);
sort(a+1,a+n+1,cmp);
while(r--)
{
win[0]=lose[0]=0;
for(int i=1;i<=n;i+=2)
if(w[a[i]]>w[a[i+1]])
{
sc[a[i]]++;
win[++win[0]]=a[i];
lose[++lose[0]]=a[i+1];
}
else
{
sc[a[i+1]]++;
win[++win[0]]=a[i+1];
lose[++lose[0]]=a[i];
}
merge();
}
printf("%d",a[q]);
return 0;
}