PAT 1144.The Missing Number（20 分）

时间限制: 150 ms  内存限制: 64 MB  代码长度限制: 16 KB

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

对数组进行从小到大排序 从>0 =1开始递增，等到数组值与递增值不同时即为该数。

#include <stdio.h>
#include <algorithm>
using namespace std;
bool cmp(int x,int y)
{
    return x<y;
}
int main()
{
    int n;
    scanf("%d",&n);
    int a[n];
    for(int i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
    }
    sort(a,a+n,cmp);
    int list=1;
    for(int i=0;i<n;i++)
    {
        if(a[i]>0&&a[i]==list)
        {
            list++;
        }
    }
    printf("%d\n",list);

    return 0;
}