[甲级传送门](https://www.patest.cn/contests/pat-a-practise/1117
)
乙级传送门
将所有数从大到小排序,从左往后数,当第i个数小于等于i时满足要求
#include<iostream>
#include<algorithm>
using namespace std;
#define MAX_N 100100
int N;
int a[MAX_N];
bool cmp(int a,int b){
return a>b;
}
int main(){
int i;
cin>>N;
for(int i=0;i<N;i++){
cin>>a[i];
}
sort(a,a+N,cmp);
for(i=0;i<N;i++){
if(a[i]<=i+1)
break;
}
cout<<i;
}