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 17Sample Output:
7 #include "iostream" #include "map" using namespace std; map<int,int> e; int main(){ int n,k; cin>>n; for (int i=0;i<n;i++) { scanf("%d",&k); e[k]++; } int num=1; while (e[num]>0)num++; cout<<num<<endl; return 0; }