PAT甲级 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

#include <iostream>
#include <unordered_set>

using namespace std;


int main() {
    int N, num;
    unordered_set<int> unorderedSet;
    cin >> N;
    for (int i = 0; i < N; ++i) {
        cin >> num;
        if (num > 0)
            unorderedSet.insert(num);
    }
    for (int i = 1; i < INT32_MAX; ++i) {
        if (!unorderedSet.count(i)) {
            cout << i;
            break;
        }
    }
    return 0;
}