# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
502090 | bigo | CONSUL (info1cup19_consul) | C++14 | 0 ms | 0 KiB |
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"
#include <map>
#include <set>
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);
}