P2343 宝石管理系统

不会写平衡树怎么办，可以用STL的vector或者是pb_ds，这个东西太乱，还是STL好用

#include<bits/stdc++.h>
using namespace std;
int read() {
	int x = 0, f = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9') {
		if (ch == '-') f = -1;
		ch = getchar();
	}
	while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
	return x * f;
}
void write(int x) {
	if (x < 0) putchar('-'), x = -x;
	if (x > 9) write(x / 10);
	putchar(x % 10 + '0');
}
void ot(int x) {
	write(x), puts("");
}
vector<int > s;
int n, m;
int main() {
	n = read(), m = read();
	for (int i = 1; i <= n; i++) {
		int a = read();
		s.insert(lower_bound(s.begin(), s.end(), a), a);
	}
	for (int i = 1; i <= m; i++) {
		int op = read(), x = read();
		if (op == 1) ot(s[s.size() - x]);
		else s.insert(lower_bound(s.begin(), s.end(), x), x);
	}
	return 0;
}

STL好