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 (≤105). 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<stdio.h>
#include<algorithm>
using namespace std;
int num[100005];
int main(){
int n;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",num+i);
}
sort(num,num+n);
int ans=1;
for(int i=0;i<n;i++){
if(num[i]>ans){
break;
}
if(num[i]==ans){
ans++;
}
}
printf("%d",ans);
return 0;
}