# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
777162 | LeaRouse | 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 "grader.cpp"
#include <map>
#define ll long long
using namespace std;
map<ll,int>m;
void solve(int n){
for(int i=1;i<=n;i++){
int a=kth(i);
m[a]++;
}
for(auto it:m){
if(it.second>(n/3)){
m.clear();
say_answer(it.first);
return;
}
}
m.clear();
say_answer(-1);
}