BestCoder Round #3

Task schedule http://acm.hdu.edu.cn/showproblem.php?pid=4907

#include<cstdio>
#include<cstring>
#define mt(a,b) memset(a,b,sizeof(a))
const int M=200010;
int a[M];
bool vis[M];
int main(){
    int t,n,m;
    while(~scanf("%d",&t)){
        while(t--){
            scanf("%d%d",&n,&m);
            mt(vis,0);
            for(int i=1;i<=n;i++){
                scanf("%d",&a[i]);
                vis[a[i]]=true;
            }
            int x=1;
            for(int i=1;i<=200000;i++){
                if(!vis[i]){
                    for(int j=x;j<=i;j++){
                        a[j]=i;
                    }
                    x=i+1;
                }
            }
            while(m--){
                scanf("%d",&x);
                printf("%d
",a[x]);
            }
        }
    }
    return 0;
}

end