rt

code：

#include<iostream>
#include<algorithm>
using namespace std;
const int N=2e5;
int m,n;
int tone[N]; 
void buble_sort(){
	for(int i=m;i>=1;i--){
		if(tone[m]>tone[m-1]) swap(tone[m],tone[m-1]);
		else return ;
	}
}
int main(){
	scanf("%d%d",&m,&n);
	for(int i=1;i<=m;i++) scanf("%d",&tone[i]);
	m++;
	sort(tone+1,tone+m);
	int op=0,x=0;
	for(int i=1;i<=n;i++){
		scanf("%d",&op);
		if(op==1) scanf("%d",&x),printf("%d\n",tone[m-x]);
		else{
			scanf("%d",&x);
			tone[++m]=x;
			buble_sort();
		}
	}
	return 0;
}