B. Polycarp Training

最新推荐文章于 2021-12-16 12:59:02 发布

Amber0130

最新推荐文章于 2021-12-16 12:59:02 发布

阅读量167

点赞数

本文链接：https://blog.csdn.net/weixin_43601103/article/details/90611025

版权

http://codeforces.com/contest/1165/problem/B

#include<bits/stdc++.h>
using namespace std;
int a[500000],n,i,k,f;
int main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
    }
    sort(a + 1, a + n + 1);
    i = 1;
    while (1) {
        k++;
        while (a[i] < k && i <= n) {
            i++;
        }

        if (i > n) {
            f = 1;
            break;
        }
        i++;
    }
    if (f) k--;
    printf("%d\n", k);
}