This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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+1);
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 |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |