RE $60pts$ 求调！

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N = 1e5 + 5;
int n, m, a[N], q, op[N], l[N], r[N];
int ans;
int tr[N * 4], tag[N * 4];
void push_up(int id) {
	tr[id] = tr[id * 2] + tr[id * 2 + 1];
	return ;
}
void Build(int id, int l, int r, int num) {
	if (l == r) {
		if (a[l] >= num) {
			tr[id] = 1;
		}
		return ;
	}
	int mid = (l + r) >> 1;
	Build(id * 2, l, mid, num);
	Build(id * 2 + 1, mid + 1, r, num);
	push_up(id);
	return ;
}
void push_down(int id, int l, int r) {
	if (tag[id]) {
		tag[id * 2] = tag[id * 2 + 1] = tag[id];
		int mid = (l + r) >> 1;
		if (tag[id] == 1) {
			tr[id * 2] = mid - l + 1;
			tr[id * 2 + 1] = r - mid;
		}
		else tr[id * 2] = tr[id * 2 + 1] = 0;
		tag[id] = 0;
	}
	return ;
}
int query(int id, int l, int r, int x, int y) {
	if (l >= x && r <= y) return tr[id];
	push_down(id, l, r);
	int mid = (l + r) >> 1, res = 0;
	if (x <= mid) res += query(id * 2, l, mid, x, y);
	if (y > mid) res += query(id * 2 + 1, mid + 1, r, x, y);
	push_up(id);
	return res;
}
void upd(int id, int l, int r, int x, int y, int val) {
	if (l >= x && r <= y) {
		tr[id] = val * (r - l + 1);
		if (val) tag[id] = 1;
		else tag[id] = -1;
		return ;
	}
	push_down(id, l, r);
	int mid = (l + r) >> 1;
	if (x <= mid) upd(id * 2, l, mid, x, y, val);
	if (y > mid) upd(id * 2 + 1, mid + 1, r, x, y, val);
	push_up(id);
	return ;
}
int query_point(int id, int l, int r, int q) {
	if (l == r && l == q) return tr[id];
	push_down(id, l, r);
	int mid = (l + r) >> 1;
	if (q <= mid) return query_point(id * 2, l, mid, q);
	else return query_point(id * 2 + 1, mid + 1, r, q);
}
bool check(int num) {
	memset(tr, 0, sizeof tr);
	memset(tag, 0, sizeof tag);
	Build(1, 1, n, num);
	for (int i = 1; i <= m; ++i) {
		int cnt1 = query(1, 1, n, l[i], r[i]), len = r[i] - l[i] + 1, cnt0 = len - cnt1;
		if (op[i] == 0) {
			upd(1, 1, n, l[i], l[i] + cnt0 - 1, 0);
			upd(1, 1, n, r[i] - cnt1 + 1, r[i], 1);
		}
		else {
			upd(1, 1, n, l[i], l[i] + cnt1 - 1, 1);
			upd(1, 1, n, r[i] - cnt0 + 1, r[i], 0);
		}
	}
	if (query_point(1, 1, n, q) == 1) return true;
	else return false;
}
int main(void) {
	cin.tie(0), cout.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
	}
	for (int i = 1; i <= m; ++i) {
		cin >> op[i] >> l[i] >> r[i];
	}
	cin >> q;
	int L = 1, R = n;
	while (L <= R) {
		int Mid = (L + R) >> 1;
		if (check(Mid)) {
			ans = Mid;
			L = Mid + 1;
		}
		else {
			R = Mid - 1;
		}
	}
	cout << ans;
    return 0;
}