#include <bits/stdc++.h>
using namespace std;
long long n, a[500000], x;
int main (){
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i=0;i<n;i++){
cin >> a[i];
}
sort(a,a+n);
for (int i=0;a[n-i]>=i;i++) x=i;
cout << x;
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 |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
3 ms |
504 KB |
Output is correct |
8 |
Correct |
17 ms |
1656 KB |
Output is correct |
9 |
Correct |
85 ms |
7544 KB |
Output is correct |
10 |
Correct |
42 ms |
4088 KB |
Output is correct |