TLE+MLE 36pts

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<ctime>
#include<iomanip>
#include<queue>
#include<stack>
#include<map>
#include<vector>
#define gh() getchar()
#define re register
typedef long long ll;
template<class T>
inline void read(T &x)
{
    x=0;
    char ch=gh(),t=0;
    while(ch<'0'||ch>'9') t|=ch=='-',ch=gh();
    while(ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+(ch^48),ch=gh();
    if(t) x=-x;
}
template<class T,class ...T1>
inline void read(T &x,T1 &...x1)
{
    read(x),read(x1...);
}
template<class T>
inline void write(T x)
{
    if(x<0) putchar('-'),x=-x;
    if(x>9) write(x/10);
    putchar(x%10+'0');
}
template<class T>
inline bool checkMax(T &x,T &y)
{
    return x<y?x=y,1:0;
}
template<class T>
inline bool checkMin(T &x,T &y)
{
    return x>y?x=y,1:0;
}
const int MAXN=1e5+10;
int Q,opt,qx;
struct B_T
{
    int Idx=0,Rt=0,x,y,z;
    struct Treap
    {
        int siz,val,rd,chi[2];
    }Tree[MAXN];
    #define ls(p) Tree[p].chi[0]
    #define rs(p) Tree[p].chi[1]
    inline int newNode(int v)
    {
        Tree[++Idx]={1,v,rand()};
        return Idx;
    }
    inline void update(int p)
    {
        Tree[p].siz=Tree[ls(p)].siz+Tree[rs(p)].siz+1;
    }
    inline void split(int p,int k,int &u,int &v)
    {
        if(!p) u=v=0;
        else
        {
            if(Tree[p].val<=k) u=p,split(rs(p),k,rs(p),v);
            else v=p,split(ls(p),k,u,ls(p));
            update(p);
        }
        return ;
    }
    inline int merge(int u,int v)
    {
        if(!u||!v) return u+v;
        if(Tree[u].rd<Tree[v].rd)
        {
            rs(u)=merge(rs(u),v);
            update(u);
            return u;
        }
        else
        {
            ls(v)=merge(u,ls(v));
            update(v);
            return v;
        }
    }
    inline void insert(int v)
    {
        x=y=0;
        split(Rt,v,x,y);
        Rt=merge(merge(x,newNode(v)),y);
    }
    inline void del(int v)
    {
        x=y=z=0;
        split(Rt,v,x,z),split(Rt,v-1,x,y);
        y=merge(ls(y),rs(y));
        Rt=merge(merge(x,y),z);
    }
    inline int rank(int v)
    {
        x=y=0;
        split(Rt,v-1,x,y);
        int res=Tree[x].siz+1;
        Rt=merge(x,y);
        return res;
    }
    inline int kth(int p,int k)
    {
        while(1)
        {
            if(k<=Tree[ls(p)].siz) p=ls(p);
            else if(k==Tree[ls(p)].siz+1) return p;
            else k-=Tree[ls(p)].siz+1,p=rs(p);
        }
    }
    inline int pre(int v)
    {
        x=y=0;
        split(Rt,v-1,x,y);
        int res=Tree[kth(x,Tree[x].siz)].val;
        Rt=merge(x,y);
        return res;
    }
    inline int nxt(int v)
    {
        x=y=0;
        split(Rt,v,x,y);
        int res=Tree[kth(y,1)].val;
        Rt=merge(x,y);
        return res;
    }
}Tree;
int main()
{
    // freopen("fhq-treap.in","r",stdin);
    // freopen("fhq-treap.out","w",stdout);
    srand(time(NULL));
    read(Q);
    while(Q--)
    {
        read(opt,qx);
        if(opt==1) Tree.insert(qx);
        else if(opt==2) Tree.del(qx);
        else if(opt==3) write(Tree.rank(qx)),puts("");
        else if(opt==4) write(Tree.Tree[Tree.kth(Tree.Rt,qx)].val),puts("");
        else if(opt==5) write(Tree.pre(qx)),puts("");
        else if(opt==6) write(Tree.nxt(qx)),puts("");
    }
    return 0;
}
/*
10
1 106465
4 1
1 317721
1 460929
1 644985
1 84185
1 89851
6 81968
1 492737
5 493598
*/

感谢各位巨佬Orz