插入输出（TREAP）

#include <stdlib.h>
#include

struct Node{

int size,key,weight;
Node* l,* r;
Node(int key):key(key){
	size=1;
	weight=rand();
	l=r=NULL;
}

};
int get_size(Nodenode){
return node==NULL?0:node->size;
}
void left_rotate(Node&a){
Node* b=a->r;
a->r=b->l;
b->l=a;
b->size=a->size;
a->size=get_size(a->l)+get_size(a->r)+1;
a=b;
}
void right_rotate(Node*&a){
Node* b=a->l;
a->l=b->r;
b->r=a;
b->size=a->size;
a->size=get_size(a->l)+get_size(a->r)+1;
a=b;
}
void insert(Node*&node,int key){
if(!node){
node=new Node(key);
}else if(key<=node->key){
node->size++;
insert(node->l,key);
if(node->l->weightweight)right_rotate(node);
}
else{
node->size++;
insert(node->r,key);
if(node->r->weightweight)left_rotate(node);
}
}
int find_kth(Nodenode,int k){
int lsize=get_size(node->l);
if(k==lsize+1)return node->key;
else if(k<=lsize)return find_kth(node->l,k);
else return find_kth(node->r,k-1-lsize);
}
int A[30000];
int main(){
Noderoot=NULL;
int m,n;
int now=1;
scanf("%d %d",&m,&n);
for(int i=1;i<=m;i++)scanf("%d",&A[i]);
int u;
for(int i=1;i<=n;i++){
scanf("%d",&u);
for(;now<=u;now++)
insert(root,A[now]);
printf("%d\n",find_kth(root,i));
}
return 0;
}