HDU 2852 KiKi's K-Number

因为一个输出超时N次。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <map>
#include <queue>
#include <ctime>
#include <set>
#define ll long long
#define MP make_pair
#define PB push_back
#define SZ(x) ((int)(x).size())
#define REP(i,n) for (int i=0; (i)<(int)n; ++(i))
#define FOR(it,c) for ( __typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it )
using namespace std;

const int N=100010;
int m,sum,cnt[N],num[N];

inline int low(int x){ return x&(-x); }

int search(int a,int k){
    int t=N-1,s=a;
    while(s<=t){
        int mid=(s+t)>>1,kk=0;
        for(int i=mid;i>0;i-=low(i)) kk+=num[i];
        if(sum-kk>=k) s=mid+1;
        else if(sum-kk+cnt[mid]<k) t=mid-1;
        else if(!cnt[mid]) t=mid-1;
        else return mid;
    }
}

int main(){
#ifndef ONLINE_JUDGE
    freopen("a.in","r",stdin);
    freopen("a.out","w",stdout);
#endif
    while(cin>>m){
        sum=0;
        memset(cnt,0,sizeof(cnt));
        memset(num,0,sizeof(num));
        while(m--){
            int x,op,k;
            scanf("%d",&op);
            if(op==0){
                scanf("%d",&x);
                cnt[x]++;
                sum++;
                for(int i=x;i<N;i+=low(i)) num[i]++;
            }
            else if(op==1){
                scanf("%d",&x);
                if(!cnt[x]) puts("No Elment!");
                else{
                    for(int i=x;i<N;i+=low(i)) num[i]--;
                    cnt[x]--;
                    sum--;
                }
            }
            else{
                scanf("%d%d",&x,&k);
                int kk=0;
                for(int i=x;i>0;i-=low(i)) kk+=num[i];
                if(sum-kk<k) puts("Not Find!");
                else printf("%d\n",search(x,sum-kk-k+1));
            }
        }
    }
        return 0;
}