Problem C: #104. 普通平衡树

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<set>
#include<vector>
#include<algorithm>
#define inf 1000000000
using namespace std;
inline 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;
}
int n;
vector<int> a;
void insert(int x)
{
	a.insert(upper_bound(a.begin(),a.end(),x),x);
	return;
}
void del(int x)
{
	a.erase(lower_bound(a.begin(),a.end(),x));
	return;
}
int find(int x)
{
	return lower_bound(a.begin(),a.end(),x)-a.begin()+1;
}
int main()
{
	n=read();
	a.reserve(200000);
	int f,x;
	for(int i=1;i<=n;i++)
	{
		f=read();x=read();
		switch(f)
		{
		case 1:insert(x);break;
		case 2:del(x);break;
		case 3:printf("%d
",find(x));break;
		case 4:printf("%d
",a[x-1]);break;
		case 5:printf("%d
",*--lower_bound(a.begin(),a.end(),x));break;
		case 6:printf("%d
",*upper_bound(a.begin(),a.end(),x));break;
		}
	}
	return 0;
}