Treap 模板

题目链接：   https://vjudge.net/contest/147756#problem/B

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <queue>
#include <algorithm>
#include <map>
#include <set>
#define ll long long
using namespace std;

struct Node {
    Node *ch[2];
    int r,v,s;
    Node(int v):v(v){ch[0]=ch[1]=NULL;r=rand();s=1;}
    bool operator < (const Node &rhs) const {

        return r<rhs.r;
    }
    int cmp(int x) const {

        if(x==v) return -1;
        return x < v ? 0 : 1;
    }
    void maintain() {

        s=1;
        if(ch[0] != NULL) s+=ch[0]->s;
        if(ch[1] != NULL) s+=ch[1]->s;
    }
};

void Rotate(Node* &o,int d)
{
    Node* k=o->ch[d^1];
    o->ch[d^1]=k->ch[d];
    k->ch[d]=o;
    o->maintain();
    k->maintain();
    o=k;
}

void Insert(Node* &o,int x)
{
    if(o==NULL) o=new Node(x);
    else
    {
        int d=(x < o->v ? 0 : 1);
        Insert(o->ch[d],x);
        if(o->ch[d]->r > o->r) Rotate(o, d^1);
    }
    o->maintain();
}

void Remove(Node* &o,int x)
{
    int d = o->cmp(x);
    if(d==-1)
    {
        Node* u=o;
        if(o->ch[0] != NULL && o->ch[1] != NULL)
        {
            int d2 = (o->ch[0]->r > o->ch[1]->r ? 1 : 0);
            Rotate(o,d2);
            Remove(o->ch[d2],x);
        }
        else
        {
            Remove(o->ch[d],x);
        }
        if(o!=NULL) o->maintain();
    }
}

int kth(Node* o, int k)
{
    if(o==NULL || k<=0 || k > o->s) return 0;
    int s=(o->ch[0]==NULL ? 0:o->ch[0]->s);
    if(k==s+1) return o->v;
    else if(k<=s) return kth(o->ch[0],k);
    else return kth(o->ch[1],k-s-1);
}

int a[30005],b[30005];

int main()
{
    int m,n,i,j;
    while(scanf("%d%d",&m,&n)!=EOF)
    {
        for(i=0;i<m;i++) scanf("%d",&a[i]);
        for(i=0;i<n;i++) scanf("%d",&b[i]);
        Node* root=NULL;
        j=0;
        for(i=0;i<m;i++)
        {
            Insert(root,a[i]);
            while(b[j]==i+1)
            {
                j++;
                printf("%d\n",kth(root,j));
                if(j==n) break;
            }
            if(j==n) break;
        }
    }
    return 0;
}