树状数组求第k大

辣鸡南瓜并不能在考场上打出平衡树，就只能退而求其次，离线用树状数组来解决啦

板子题传送门：https://www.luogu.org/problemnew/show/P3369

code：

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <ctime>
#define maxn 105000
using namespace std;

int n,tot,sz;
int opt[maxn],val[maxn],num[maxn],c[maxn];

int read()
{
	int xx=0,kk=1;char ch=' ';
	while(!isdigit(ch)){ch=getchar();if(ch=='-')kk=-1;}
	while(isdigit(ch)){xx=xx*10+ch-'0';ch=getchar();}
	return kk*xx;
}

int pos(int x)
{
	return lower_bound(num+1,num+1+sz,x)-num;
}

int lowbit(int x)
{
	return x&-x;
}

void add(int x,int k)
{
	for(x;x<=sz;x+=lowbit(x)) c[x]+=k;
}

int query(int x)
{
	int tmp=0;
	for(x;x;x-=lowbit(x)) tmp+=c[x];
	return tmp;
}

int kth(int x)
{
	int rs=0;
	for(int i=17;i>=0;--i)
	{
		rs+=(1<<i);
		if(rs>sz||c[rs]>=x) rs-=(1<<i);
		else x-=c[rs];
	}
	return num[rs+1];
}

int main()
{
	n=read();
	for(int i=1;i<=n;++i)
	{
		opt[i]=read(),val[i]=read();
		if(opt[i]!=4) num[++tot]=val[i];
	}
	sort(num+1,num+1+tot);
	sz=unique(num+1,num+1+tot)-num-1;
	for(int i=1;i<=n;++i)
	{
		int x=val[i];
		switch(opt[i])
		{
			case 1:add(pos(x),1);break;
			case 2:add(pos(x),-1);break;
			case 3:printf("%d\n",query(pos(x)-1)+1);break;
			case 4:printf("%d\n",kth(x));break;
			case 5:printf("%d\n",kth(query(pos(x)-1)));break;
			case 6:printf("%d\n",kth(query(pos(x))+1));break;
		}
	}
	return 0;
}