题目:https://pintia.cn/problem-sets/994805260223102976/problems/994805269312159744
#include<stdio.h>
int main()
{ int n;
scanf("%d",&n);
int s[n];
for(int i=0;i<n;i++)
{
scanf("%d",&s[i]);
}
int e;
for(int k=1;k<=n;k++)
{ int count=0;
for(int l=0;l<n;l++)
{
if(s[l]>k)
{
count++;
}
}
if(count>=k)
e=k;
}
printf("%d",e);
return 0 ;
}
复杂度o(n^2) 超时