제출 #502206

#제출 시각아이디문제언어결과실행 시간메모리
502206bigoCONSUL (info1cup19_consul)C++14
19 / 100
725 ms200 KiB
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
void solve(int n) {
    map<int, int>his;
    set<int>vec;
    for (int i = 0; i < n; i++) {
        int k = kth(i+1);
        his[k]++;
        vec.insert(k);
    }
    bool flag = false;
    for (auto u : vec) {
        if (his[u] > n / 3) {
            say_answer(u);
            flag = true;
            break;
        }
    }
    if(!flag)
        say_answer(-1);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...