For this Question: Given an array of N integers, your task is to find the smallest positive number which is not present in the given array.First line of input contains a single integer N, next line contains N space separated integers depicting the values of array.

Constraints:- 
1 < = N < = 1000000
-10^6 < = Arr[i] < = 10^6Print the smallest positive integer not present in the given array.Sample Input:-
5
-2 1 0 4 5

Sample Output:-
2

Sample Output:-
4
-1 1 2 3

Sample Output:-
4, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
#define int long long
#define max1 1000002
int a[max1];
signed main(){

int n;
cin>>n;
int x;
for(int i=0;i<n;i++){
    cin>>x;
    if(x>=1){
        a[x]++;
    }
}
for(int i=1;i<max1;i++){
    if(a[i]==0){cout<<i;return 0;}
}
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not?