1144 The Missing Number （20 分）

1144 The Missing Number （20 分）

Given N integers, you are supposed to find the smallest positive integer that is NOT in the given list.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (≤10​5​​). Then N integers are given in the next line, separated by spaces. All the numbers are in the range of int.

Output Specification:

Print in a line the smallest positive integer that is missing from the input list.

Sample Input:

10
5 -25 9 6 1 3 4 2 5 17

Sample Output:

7

#include <stdio.h>
#include <stdlib.h>
int n,a[100010];
int main()
{
    int i,x;

    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        scanf("%d",&x);
        if(x>0&&x<100010)
        {
            a[x]=1;
        }

    }
    for( i=1;i<100010;i++)
    {
        if(a[i]==0)
        {
             printf("%d\n",i);
              break;
        }


    }
return 0;
}