KiKi's K-Number（树状数组+二分）

Problem Description
For the k-th number, we all should be very familiar with it. Of course,to kiki it is also simple. Now Kiki meets a very similar problem, kiki wants to design a container, the container is to support the three operations.
Push: Push a given element e to container
Pop: Pop element of a given e from container
Query: Given two elements a and k, query the kth larger number which greater than a in container;
Although Kiki is very intelligent, she can not think of how to do it, can you help her to solve this problem?
Input
Input some groups of test data ,each test data the first number is an integer m (1 <= m <100000), means that the number of operation to do. The next m lines, each line will be an integer p at the beginning, p which has three values:
If p is 0, then there will be an integer e (0 <e <100000), means press element e into Container.
If p is 1, then there will be an integer e (0 <e <100000), indicated that delete the element e from the container
If p is 2, then there will be two integers a and k (0 <a <100000, 0 <k <10000),means the inquiries, the element is greater than a, and the k-th larger number.
Output
For each deletion, if you want to delete the element which does not exist, the output "No Elment!". For each query, output the suitable answers in line .if the number does not exist, the output "Not Find!".
Sample Input
5
0 5
1 2
0 6
2 3 2
2 8 1
7
0 2
0 2
0 4
2 1 1
2 1 2
2 1 3
2 1 4
Sample Output
No Elment!
6
Not Find!
2
2
4

Not Find!

//添加一个数，该数对应的节点+1,删除一个数，分两种情况，一种是该数对应的节点为0，输出Not Find,否则该数对应的节点-1，然后用二分查询查找比a大k个数的数

#include<stdio.h>
#include<string.h>
#define Max 100005
#define INF 1<<30
int tree[Max];
int m,op,a,k;
int lowbit(int x)
{
    return x & (-x);
}
void modify(int x,int add)//一维
{  
    while(x<Max)  
    {      
        tree[x]+=add;    
        x+=lowbit(x); 
    }
}
int query(int x)//求1到x之间的和
{  
    int ret=0; 
    while(x!=0)  
    {       
        ret+=tree[x];   
        x-=lowbit(x);   
    }  
    return ret;
}
int find(int low,int high)
{
	int ret=INF,mid;
	while(low<=high)
	{
		mid=(low+high)/2;
		if(query(mid)-query(a)>=k)
		{
			high=mid-1;
			if(mid<ret) ret=mid;
		}
		else low=mid+1;
	}
	return ret;
}
int main()
{
	//freopen("b.txt","r",stdin);
	while(scanf("%d",&m)==1)
	{
		int i,j;
		memset(tree,0,sizeof(tree));
		while(m--)
		{
			scanf("%d",&op);
			if(op==0)
			{
				scanf("%d",&a);
				 modify(a,1);
			}
			else if(op==1)
			{
				scanf("%d",&a);
				if(query(a)-query(a-1)==0)
					printf("No Elment!\n");
				else modify(a,-1);
			}
			else
			{
				scanf("%d %d",&a,&k);
				int ret=find(a,Max-1);
				if(ret==INF) printf("Not Find!\n");
				else printf("%d\n",ret);
			}
		}
	}
	return 0;
}