# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
384603 | fadi57 | 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<bits/stdc++.h>
using namespace std;
void solve(int n)
{
map<int,int>mp;
/// insert your code
/// for example
int z=n/3;
int ok=0;
for(int i=1;i<=n;i++){
int me=kth(i);
mp[me]++;
if(mp[me]>z){
ok=1;
say_answer(me);
break;
}
}if(!ok){say_answer(-1);}
}