#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
void solve(int n){
map<int, int>his;
set<int>vec;
for (int i = 0; i < n; i++) {
int k = kth(i);
his[k]++;
vec.insert(k);
}
for (auto u : vec) {
if (his[u] >= n / 3)
say_answer(u);
}
say_answer(-1);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
268 KB |
Wrong query format |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
200 KB |
Wrong query format |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
200 KB |
Wrong query format |
2 |
Halted |
0 ms |
0 KB |
- |