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 (≤105). 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
Code:
#include<bits/stdc++.h>
using namespace std;
unordered_set<int>S;
int n;
int main(){
cin>>n;
while(n--){
int x;
cin>>x;
S.insert(x);
}
int number=1;
while(S.count(number))
number++;
cout<<number<<endl;
}