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⁵
​​ ). 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

题⽬⼤意：

给n个数字，找到不在这个数字列表⾥⾯的最⼩的正整数

分析：

将每个数字出现的次数存储在map⾥⾯，num从1开始，如果m[num] == false说明不存在，则输出
这个num

//1144 The Missing Number (20分)
#include <bits/stdc++.h>
using namespace std;
map<int,bool> m;
int main() 
{
	int n;
	cin>>n;
	for(int i=0;i<n;i++)
	{
		int num;
		cin>>num;	
		if(num>=0)
			m[num]=true;	
	}
	int k=1;
	while(1)
	{
		if(m[k]==false)
		{
			cout<<k;
			return 0;
		}	
		k++;	
	}
	return 0;
}