# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
240929 | 2020-06-21T14:04:31 Z | SamAnd | Hindeks (COCI17_hindeks) | C++17 | 101 ms | 5876 KB |
#include <bits/stdc++.h> using namespace std; #define m_p make_pair #define all(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define fi first #define se second typedef long long ll; mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); mt19937 rnf(2106); const int N = 1000006; int a[N]; void solv() { int qq; scanf("%d", &qq); while (qq--) { int x; scanf("%d", &x); ++a[x]; } int q = 0; for (int i = N - 1; i >= 0; --i) { q += a[i]; if (q >= i) { printf("%d\n", i); return; } } } int main() { #ifdef SOMETHING freopen("input.txt", "r", stdin); //freopen("output.txt", "w", stdout); #endif // SOMETHING //ios_base::sync_with_stdio(false), cin.tie(0); solv(); return 0; } //while ((double)clock() / CLOCKS_PER_SEC <= 0.9){}
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 384 KB | Output is correct |
2 | Correct | 6 ms | 256 KB | Output is correct |
3 | Correct | 6 ms | 384 KB | Output is correct |
4 | Correct | 6 ms | 384 KB | Output is correct |
5 | Correct | 6 ms | 384 KB | Output is correct |
6 | Correct | 6 ms | 384 KB | Output is correct |
7 | Correct | 7 ms | 384 KB | Output is correct |
8 | Correct | 20 ms | 1408 KB | Output is correct |
9 | Correct | 101 ms | 5876 KB | Output is correct |
10 | Correct | 40 ms | 2168 KB | Output is correct |