int minPosNumberDisappeared(int *numbers,int n){
int i,j,t;
for(j=0;j<n;j++){
for(i=0;i<n-j;i++){
if(numbers[i]>numbers[i+1]){
t=numbers[i];
numbers[i]=numbers[i+1];
numbers[i+1]=t;
}
}
}
int flag=0;
for(i=0;i<n-1;i++){
if(numbers[i]>=0){
flag=1;
if(numbers[i+1]-numbers[i]>1){
return numbers[i]+1;
}
}
}
if(flag){
return numbers[n-1]+1;
}
return 0;
}