# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
524458 | iskhakkutbilim | 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"
using namespace std;
void solve(int n)
{
map<int, int> mp;
int q = 50
while(q--){
int i = rand() % n;
int x = kth(i+1);
mp[x]++;
if(mp[x] > n / 3){
say_answer(x);
return;
}
}
say_answer(-1);
}