pat 甲级 散列 A1144 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<iostream>
#include<set>
using namespace std;
int main(){
	int n,a;
	cin>>n;
	set<int> se;
	for(int i=0;i<n;i++){
		cin>>a;
		se.insert(a);
	}
	int num=0;
    auto it=se.begin();
	while(*it<=0) it++;
    while(++num){
        if(*it!=num){
            cout<<num;
            return 0;
        }
        it++;
    }
}