#include <iostream>
#include <unordered_set>
#include <algorithm>
using namespace std;
unordered_set<int> numbers;
int main(){
int n;
scanf("%d",&n);
for(int i = 0;i < n;i++){
int temp;
scanf("%d",&temp);
if(temp > 0)
numbers.insert(temp);
}
int k = 1;
while(1){
if(numbers.find(k) == numbers.end()){
printf("%d",k);
break;
}
k++;
}
system("pause");
return 0;
}
PAT | A1144 The Missing Number
最新推荐文章于 2023-09-19 12:53:18 发布