大撒大撒发生飞洒范德萨发生

#include <bits/stdc++.h>
using namespace std;

const int N = 200010;

int n, m, k;
int s[N], w[N], q[N], win[N], lose[N];

bool cmp(int a, int b)
{
	if (s[a] != s[b]) return s[a] > s[b];
	return a < b;
}

int main()
{
	cin >> n >> m >> k;
	
	for (int i = 0; i < n * 2; i ++ ) cin >> s[i];
	for (int i = 0; i < n * 2; i ++ ) cin >> w[i];
	for (int i = 0; i < n * 2; i ++ ) q[i] = i;
	
	sort(q, q + n * 2, cmp);
	
	while (m -- )
	{
		int loser = 0, winer = 0;
		for (int i = 0; i < n * 2; i += 2)
		{
			int a = q[i], b = q[i + 1];
			if (w[a] < w[b])
			{
				s[b] ++ ;
				win[winer ++ ] = b;
				lose[loser ++ ] = a;
			}
			else
			{
				s[a] ++ ;
				win[winer ++ ] = a;
				lose[loser ++ ] = b; 
			}
		}
		
		int i = 0, j = 0, t = 0;
		while (i < winer && j < loser)
			if (cmp(lose[j], win[i]))
				q[t ++ ] = lose[j ++ ];
			else
				q[t ++ ] = win[i ++ ];
		
		while (i < winer) q[t ++ ] = win[i ++ ];
		while (j < loser) q[t ++ ] = lose[j ++ ];
	}
	
	printf("%d\n", q[k - 1] + 1);
	
	return 0;
}