Smallest Absent Positive

Difficulty: 1400 3000 ms 128 MB

implementation

Print the smallest positive integer that does NOT appear in the array.

Input: the first line has N; the second line has N integers.

Output: the smallest missing positive.

Constraints:

• 1 ≤ N ≤ 10⁵
• |a_i| ≤ 10⁹

Sample Tests

5
3 4 -1 1 1

2

3
1 2 3

4

Read the Editorial