Submission #384619

#	Time	Username	Problem	Language	Result	Execution time	Memory
384619		fadi57	CONSUL (info1cup19_consul)	C++14	0 / 100	24 ms	384 KiB

consul

//#include "grader.cpp"
#include<bits/stdc++.h>
#include "grader.h"

using namespace std;

void solve(int n)
{
    map<int,int>mp;


    int ok=0;
    int mid=n/2;
    int ans;
    for(int i=1;i<=mid;i++){

           int myfreq=cnt(i);
        if(myfreq>(n/3)){
                ok=1;
          ans=kth(i);
            break;
        }
    }

    if(ok==0){
      for(int i=mid+1;i<=n;i++){
           // int me=kth(i);
           // mp[me]++;
           int myfreq=cnt(i);
        if(myfreq>(n/3)){
                ok=1;
             ans=kth(i);
             say_answer(ans);
            break;
        }
    }

    }
     if(!ok){
        say_answer(-1);
    }





}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 20
• Subtask 3: 0 / 65