Holiday 11

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
const int M=100000+10;
struct SplayTree {
	int cnt,root,l[M],r[M],v[M],s[M];
	SplayTree():cnt(0),root(0) {
		memset(l,0,sizeof(l)); memset(r,0,sizeof(r)); 
		memset(v,0,sizeof(v)); memset(s,0,sizeof(s));
	}
	void update(int x) { 
		s[x]=s[l[x]]+s[r[x]]+1;
	}
	void l_rot(int &x) {
		int y=r[x];
		r[x]=l[y],l[y]=x;
		update(x),update(y);
		x=y;
	}
	void r_rot(int &x) {
		int y=l[x];
		l[x]=r[y],r[y]=x;
		update(x),update(y);
		x=y;
	}
	int maxx(int x) {
		for(;r[x];x=r[x]); 
		return v[x];
	}
	void splay(int &x,int k) {
		if(v[x]==k) return ;
		if(k<v[x]) splay(l[x],k),r_rot(x);
		else splay(r[x],k),l_rot(x);
	}
	void merge(int &x,int &y) {
		if(!x) root=y;
		else if(!y) root=x;
		else splay(x,maxx(x)),r[x]=y,root=x;
	}
	void insert(int &x,int k) {
		if(!x) x=++cnt,v[x]=k,s[x]=1;
		else if(k<v[x]) insert(l[x],k),r_rot(x);
		else insert(r[x],k),l_rot(x);
	}
	void delet(int &x,int k) {
		splay(root,k);
		merge(l[root],r[root]);
	}
	int rank(int x,int k,int ans) {
		while(x) 
			if(v[x]<k) ans+=s[l[x]]+1,x=r[x];
			else x=l[x];
		return ans;
	}
	int kth(int x,int k,int ans) {
		while(x) {
			int q=s[l[x]]+1;
			if(q==k) { ans=v[x]; break; }
			else if(k<q) x=l[x]; else x=r[x],k-=q;
		}
		splay(root,ans);
		return ans;
	}
	int pre(int x,int k,int ans) {
		while(x) 
			if(v[x]<k) ans=max(ans,v[x]),x=r[x];
			else x=l[x];
		splay(root,ans);
		return ans;
	}
	int suc(int x,int k,int ans) {
		while(x) 
			if(v[x]>k) ans=min(ans,v[x]),x=l[x];
			else x=r[x];
		splay(root,ans);
		return ans;
	}
}t;
int main() {
	int m,opt,x;
	scanf("%d",&m);
	while(m--) {
		scanf("%d%d",&opt,&x);
		if(opt==1) t.insert(t.root,x);
		else if(opt==2) t.delet(t.root,x);
		else if(opt==3) printf("%d\n",t.rank(t.root,x,1));
		else if(opt==4) printf("%d\n",t.kth(t.root,x,0));
		else if(opt==5) printf("%d\n",t.pre(t.root,x,(int)-1e8));
		else printf("%d\n",t.suc(t.root,x,(int)1e8));
	}
	return 0;
}