#include<bits/stdc++.h>
using namespace std;
// 注意边界值问题
const long long M = 1e5;
int main( )
{
long long m;
cin >> m;
long long arr[m];
for(long long i=0;i<m;i++){
cin >> arr[i];
}
long long dp[M];
memset(dp, 0, sizeof(dp));
for(long long i=0;i<m;i++){
dp[arr[i]]++;
}
long long ans = 0;
for(long long j=0;j<=M;j++){
if(dp[j] >= j){
ans = j;
}
}
cout << ans;
return 0;
}
10-09
1026
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
09-01
1249
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
01-29
1623
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
12-03