Submission #1302618

#TimeUsernameProblemLanguageResultExecution timeMemory
1302618yusifmCONSUL (info1cup19_consul)C++20
19 / 100
234 ms424 KiB
//pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
void solve(int n)
{
    int ans=-1;
    vector<int>nums;
    map<int,int>counts;
    for(int i=0;i<n;i++)
    {
        nums.push_back(kth(i+1));
    }
    for(int i=0;i<nums.size();i++)
    {
        counts[nums[i]]++;
    }
    for(auto cnt:counts)
    {
        if(cnt.second>n/3)
        {
            ans=cnt.first;
        }
    }
    say_answer(ans);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...