//题意:有一个容器可以增,删,查找,删除时若不存在则输入No Element,查找时不存在则输入Not Find;
//利用树状数组和二分查找解决
//首先利用树状数组保存其数组元素的状态,若a存在则getSum(a) - getSum(a - 1)必须大于0,因为a > 0
//若a不存在,则更新树状数组
//查找的时候利用二分查找,这里注意由于我们是查找比a大的第k个元素,所以并不能像原来的二分查找那样,找到k=getSum(x) - getSum(a)就立刻返回
//因为有可能x是不存在的,所以我们只能找到满足k=getSum(x) - getSum(a)的最小的x返回,这样x才是找到的值
#include <iostream>
#include <algorithm>
using namespace std;
#define NSIZ 100200
int tree[NSIZ];
int lowbit(int i)
{
return i&(-i);
}
int getSum(int i)
{
int sum = 0;
while(i >= 1)
{
sum += tree[i];
i -= lowbit(i);
}
return sum;
}
void update(int i, int x)
{
while(i <= NSIZ)
{
tree[i] += x;
i += lowbit(i);
}
}
void binarySearch(int a, int k)
{
int left = a + 1, right = NSIZ;
int num1 = getSum(a), num2 = 0;
int mid = 0;
while(left <= right)
{
mid = left + (right - left) / 2;
num2 = getSum(mid);
if (num2 - num1 < k)
{
left = mid + 1;
}
else
{
right = mid - 1;
}
}
if (left >= NSIZ)
{
printf("Not Find!\n");
}
else
{
printf("%d\n", left);
}
}
int main()
{
int i, j, p, m;
int a, k, e;
while(scanf("%d", &m) != EOF)
{
memset(tree, 0, sizeof(tree));
for (i = 0;i < m; ++i)
{
scanf("%d", &p);
switch(p)
{
case 0:
{
scanf("%d", &e);
update(e, 1);
}
break;
case 1:
{
scanf("%d", &e);
if (getSum(e) - getSum(e-1) == 0)
{
printf("No Elment!\n");
}
else
{
update(e, -1);
}
}
break;
case 2:
{
scanf("%d %d", &a, &k);
binarySearch(a, k);
}
break;
default:
break;
}
}
}
return 0;
}