n = int(input())
a = list(map(int, input().split()))
a.sort(reverse=True)
h = 0
while h < n and a[h] >= h + 1:
h += 1
print(h)
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
22 ms |
3 KB |
Output is correct |
| 2 |
Correct |
29 ms |
3 KB |
Output is correct |
| 3 |
Correct |
32 ms |
3 KB |
Output is correct |
| 4 |
Correct |
28 ms |
3 KB |
Output is correct |
| 5 |
Correct |
26 ms |
3 KB |
Output is correct |
| 6 |
Correct |
43 ms |
3 KB |
Output is correct |
| 7 |
Correct |
39 ms |
4 KB |
Output is correct |
| 8 |
Correct |
154 ms |
14 KB |
Output is correct |
| 9 |
Runtime error |
157 ms |
46 KB |
Execution failed because the return code was nonzero |
| 10 |
Correct |
412 ms |
46 KB |
Output is correct |
