https://www.patest.cn/contests/pat-a-practise/1117
#include <cstdio>
#include <algorithm>
using namespace std;
int a[1000001];
int main()
{
fill(a, a + 100001, 0);
int n,len,maxLen = 0;
scanf("%d",&n);
for (int i = 1; i <=n; i++)
{
scanf("%d",&len);
if (maxLen < len) maxLen = len;
if(len != 0) a[len - 1]++;
}
for (int i = maxLen-2; i >=0; i--)
{
a[i] =a[i] + a[i + 1];
}
for (int i = n; i >=0; i--)
{
if (i <= a[i]) {
printf("%d\n", i);
break;
}
}
return 0;
}