1144 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 (≤). 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，排序一下就好了。

#include <bits/stdc++.h>
using namespace std;

map<int,int> mp
int main(){
    int n, m;
    cin >> n;
    for(int i = 0; i < n ; i++){
        cin >> m;
        if(m)
            mp[m] = 1;
    }
    for(int i = 1; i <= n+1; i++){
        if(mp[i] == 0){
            cout <<i<<endl;
            return 0;
        }
    }
    return 0;
}