#include <iostream>
#include <algorithm>
using namespace std;
int n,v[500010],i;
int main() {
cin>>n;
for (i=1;i<=n;i++)
cin>>v[i];
sort(v+1,v+n+1);
for (i=n;i>=1;i--) {
if (v[i]<n-i+1) {
cout<<n-i;
return 0;
}
}
cout<<n;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
256 KB |
Output is correct |
4 |
Correct |
2 ms |
256 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
7 ms |
376 KB |
Output is correct |
8 |
Correct |
59 ms |
760 KB |
Output is correct |
9 |
Correct |
318 ms |
2204 KB |
Output is correct |
10 |
Correct |
161 ms |
1272 KB |
Output is correct |