题解 | 蛇鸟

#include <iostream>
#include <algorithm>
#include <cstring>

using namespace std;

const int N = 1010;
int q[N];
int n,l;

int main() {
    scanf("%d %d",&n,&l);
    for(int i=1;i<=n;i++)
        scanf("%d",&q[i]);
    sort(q+1,q+1+n);
    
    for(int i=1;i<=n;i++){
        if(q[i] <= l){
            ++l;
        }
    }
    printf("%d",l);
    return 0;
}