# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
364095 | yasseenkamel | 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 "grader.cpp"
bool vis[1000000005];
void solve(int n){
int a[n + 5];
for(int i = 1 ; i <= n ; i ++){
int x = kth(i);
a[i] = x;
}
sort(a,a + n);
int cnt = 1;
for(int i = 2 ; i <= n ; i ++){
if(a[i] != a[i - 1]){
if(cnt > n / 3){
say_answer(a[i - 1]);
return;
}
cnt = 0;
}
cnt ++;
}
if(cnt > n / 3){
say_answer(a[n]);
return;
}
say_answer(-1);
}