# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
364078 | ahmedfouadnew | CONSUL (info1cup19_consul) | C++17 | 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 "grader.h"
//#include "grader.cpp"
#define pb push_back
void solve(int n)
{
vector<int>v;
for(int i=1;i<=n;i++)
{
v.pb(kth(i+1));
}
sort(v.begin(),v.end());
int cur=0;
for(int i=0;i<v.size();i++)
{
if(!i)
{
cur=1;
}
else
{
if(v[i]==v[i-1])
{
cur++;
}
else cur=1;
}
if(cur>=n/3+1)
{
say_answer(v[i]);
break;
}
}
}