A1142
Description:
找出不在给定序列的最小正整数;
思路:
- 把序列中的数存在set里,从1开始顺序遍历找到不在set中的数就break输出;
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#include<algorithm>
#include<map>
#include<set>
#include<vector>
#include<queue>
using namespace std;
int main()
{
#ifdef ONLINE_JUDGE
#else
freopen("1.txt", "r", stdin);
#endif // ONLINE_JUDGE
int n;
set<int>num;
scanf("%d", &n);
int t;
while(n--){
scanf("%d", &t);
num.insert(t);
}
int ans = 1;
while(num.find(ans)!=num.end())ans++;
cout<<ans<<endl;
return 0;
}