POJ 1442 Black Box(treap)

看这里
treap模板,询问第k大

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>

using namespace std;

#define LL long long 
#define pii pair<int, int>
#define MP make_pair
#define inf 0x3f3f3f3f
#define N 100010

int ch[N][2];
int rand_val[N], key[N], sz[N], cnt[N];
int tot;

int creat(int val){
    ++tot;
    ch[tot][0] = ch[tot][1] = 0;
    rand_val[tot] = rand();
    key[tot] = val;
    sz[tot] = cnt[tot] = 1;
    return tot;
}
int cmp(int x, int val){
    if(key[x] == val) return -1;
    return key[x] < val ? 1 : 0;
}
void push_up(int x){
    sz[x] = cnt[x] + sz[ch[x][0]] + sz[ch[x][1]];
}
void rot(int &x, int d){
    int k = ch[x][d^1];
    ch[x][d^1] = ch[k][d];
    ch[k][d] = x;
    push_up(x), push_up(k);
    x = k;
}
void insert(int &x, int val){
    if(x == 0){
        x = creat(val);
        return ;
    }
    int d = cmp(x, val);
    if(d == -1){
        cnt[x]++, sz[x]++;
        return ;
    }
    insert(ch[x][d], val);
    if(rand_val[ch[x][d]] > rand_val[x]) rot(x, d ^ 1);
    push_up(x);
}
void del(int &x, int val){
    if(x == 0) return ;
    int d = cmp(x, val);
    if(d == -1){
        if(cnt[x] > 1){
            cnt[x]--, sz[x]--; return ;
        }
        if(!ch[x][0]) x = ch[x][1];
        else if(!ch[x][1]) x = ch[x][0];
        else{
            int d2 = rand_val[ch[x][0]] > rand_val[ch[x][1]] ? 1 : 0;
            rot(x, d2);
            del(ch[x][d2], val);
        }
    }
    else del(ch[x][d], val);
    if(x) push_up(x);
}

int kth(int x, int k){
    if(!x) return -1;
    int tmp = sz[ch[x][0]];
    if(k <= tmp) return kth(ch[x][0], k);
    k -= tmp;
    if(k <= cnt[x]) return key[x];
    return kth(ch[x][1], k - cnt[x]);
}
int a[N], b[N];
int main(){
    int n, m;
    while(scanf("%d%d", &n, &m) != EOF){
        for(int i = 1; i <= n; ++i)
            scanf("%d", &a[i]);
        for(int i = 1; i <= m; ++i)
            scanf("%d", &b[i]);
        tot = 0;
        int k = 1, i = 1, j = 1, rt = 0;
        while(i <= n){
            insert(rt, a[i]);
            while(i == b[j]){
                printf("%d\n", kth(rt, k));
                k++, j++;
            }
            i++;
        }
    }
    return 0;
}