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 ( $\leq). 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

先挑软柿子捏一下。
其实不用map，排序一下就好了。

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 
 4 map<int,int> mp
 5 int main(){
 6     int n, m;
 7     cin >> n;
 8     for(int i = 0; i < n ; i++){
 9         cin >> m;
10         if(m)
11             mp[m] = 1;
12     }
13     for(int i = 1; i <= n+1; i++){
14         if(mp[i] == 0){
15             cout <<i<<endl;
16             return 0;
17         }
18     }
19     return 0;
20 }