#include <stdio.h>
#include <algorithm>
#include <memory.h>
int read(int x = 0, int f = 0, char ch = getchar())
{
while ('0' > ch or ch > '9')
f = ch == '-', ch = getchar();
while ('0' <= ch and ch <= '9')
x = x * 10 + (ch ^ 48), ch = getchar();
return f ? -x : x;
}
const int N = 5e5 + 5;
int n;
int a[N];
int main()
{
// freopen("hindeks.in", "r", stdin), freopen("hindeks.out", "w", stdout);
n = read();
for (int i = 1; i <= n; i++)
a[i] = read();
std::sort(a + 1, a + 1 + n);
for (int i = n; i >= 0; i--)
if (a[i] < n - i + 1)
{
printf("%d", n - i);
return 0;
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
0 ms |
364 KB |
Output is correct |
3 |
Correct |
0 ms |
364 KB |
Output is correct |
4 |
Correct |
0 ms |
364 KB |
Output is correct |
5 |
Correct |
0 ms |
364 KB |
Output is correct |
6 |
Correct |
0 ms |
364 KB |
Output is correct |
7 |
Correct |
1 ms |
364 KB |
Output is correct |
8 |
Correct |
11 ms |
748 KB |
Output is correct |
9 |
Correct |
63 ms |
2304 KB |
Output is correct |
10 |
Correct |
28 ms |
1260 KB |
Output is correct |