Submission #1633123

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
const int N=2e5+100;
int a[N];bool b[N];
inline bool check(int n,int mid) {
	for (int i=1;i<=n*2-1;i++) b[i]=a[i]>mid;
	for (int i=1;i<n;i++) {
		if (b[n+i-1]==b[n+i]) return b[n+i];
		if (b[n-i+1]==b[n-i]) return b[n-i];
	}
	return b[n]^(~n&1);
}
int main()
{
	int n,i,l,r,mid;
	for (i=1,cin>>n;i<=n*2-1;i++) cin>>a[i];
	l=1,r=n*2-1;
	while (l!=r) {
		mid=(l+r)>>1;
		if (check(n,mid)) l=mid+1;
		else r=mid;
	}
	printf("%d\n",l);
	return 0;
}

Submission Info

Judge Result