제출 #933367

#제출 시각아이디문제언어결과실행 시간메모리
933367SulACONSUL (info1cup19_consul)C++17
0 / 100
20 ms692 KiB
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;

void solve(int n) {
    vector<int> a;
    a.reserve(n);
    for (int i = 1; i <= n; i++) a.push_back(i);
    srand(time(NULL));
    int queries = 30;
    while (queries--) {
        int i = (rand() % a.size()) + 1;
        int x = kth(i);
        if (cnt(x) > (n+2)/3) {cout << x; return;}
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...