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<bits/stdc++.h>
using namespace std;
int a[100050];
int main()
{
	int n;
	scanf("%d",&n);
	for(int i = 1;i<=n;i++)
		scanf("%d",&a[i]);
	sort(a+1,a+1+n);
	int minn = 1;
	for(int i = 1;i<=n;i++)
	{
		if(a[i]<=0)continue;
		else 
		{
			if(a[i]<minn)continue;
			
			if(minn==a[i])
			{
				minn++;
			}else 
			{
				printf("%d\n",minn);
				return 0;
			}
		}
	}
	printf("%d\n",minn);
	return 0;	
}