1060. 爱丁顿数(25)

逻辑题，满足a[i]>i即可

#include<cstdio>
#include<algorithm>
using namespace std;
int cmp(int a,int b)
{
	return a>b;
}
int main()
{
	//freopen("1060.txt","r",stdin);
	int n;scanf("%d",&n);int a[n+1];
	for(int i=1;i<=n;i++)	scanf("%d",&a[i]);
	sort(a+1,a+n+1,cmp);//按照从大到小进行排序 
	int ans=0,p=1;
	while(ans<=n&&a[p]>p)
	{
		ans++;p++;
	}
	printf("%d",ans);
	return 0;
}