开了O2，关流也不行啊！

妈妈，这题有毒，我要回家！！

码：

#include <iostream>
#include <algorithm>

using namespace std;

struct node
{
	int id, score, p;
};

int n, r, q;
node a[200005];

bool cmp(node x, node y)
{
	if (x.score != y.score)
	{
		return x.score > y.score;
	}
	return x.id < y.id;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> r >> q;
	for (int i = 1; i <= 2 * n; i++)
	{
		cin >> a[i].score;
		a[i].id = i;
	}
	for (int i = 1; i <= 2 * n; i++)
	{
		cin >> a[i].p;
	}
	sort(a + 1, a + 2 * n + 1, cmp);
	for (int i = 1; i <= r; i++)
	{
		for (int j = 1; j < 2 * n; j += 2)
		{
			if (a[j].p > a[j + 1].p)
			{
				a[j].score++;
			}
			else
			{
				a[j + 1].score++;
			}
		}
		sort(a + 1, a + 2 * n + 1, cmp);
	}
	cout << a[q].id << endl;
	return 0;
}