样例过全WA求调

#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+5;

int a[N];
multiset<int> l, r;
multiset<int>::iterator it;

int main()
{
	int n, x;
	scanf("%d", &n);
	for(int i=1; i<=n; i++)
	{
		scanf("%d", &a[i]);
		if(i & 1)
		{
			if(i == 1)
				printf("%d\n", a[1]), x = a[1];
			else
			{
				if(a[i] <= x && a[i-1] <= x)
				{
					l.insert(a[i-1]), l.insert(a[i]), r.insert(x);
					it = l.end(), it --;
					x = *it, l.erase(it);
				}
				else if(a[i] >= x && a[i-1] >= x)
				{
					r.insert(a[i-1]), r.insert(a[i]), l.insert(x);
					it = r.begin();
					x = *it, r.erase(it);
				}
				else
					l.insert(min(a[i], a[i-1])), r.insert(min(a[i], a[i-1]));
				printf("%d\n", x);
			}
		}
	}
	
	return 0;
}