1144 The Missing Number (20分)

emmmm确实用map简单 

#include <iostream>
#include <map>
using namespace std;
int main() {
 int n, a, num = 0;
 cin >> n;
 map<int, int> m;
 for (int i = 0; i < n; i++) {
     cin >> a;
     m[a]++;
 }
 while(++num)
     if (m[num] == 0) break;
 cout << num;
 return 0; 
}

#include<bits/stdc++.h>
using namespace std;
const int maxn=100100;
int d[maxn];
const int N=0x7fffffff; 
int main(){
    int n;
    scanf("%d",&n);
    fill(d,d+maxn,N);
    for(int i=0;i<n;i++) scanf("%d",&d[i]);
    int ans=1;
    sort(d,d+maxn);
    for(int i=0;i<n;i++){
        if(d[i]<=0) continue;
        if(d[i]<ans) continue;
        if(d[i]==ans){
            ans++;
        }else{
            break;
        }
    }
    printf("%d",ans);
    return 0;
}