# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
364092 | 2021-02-08T08:27:45 Z | soba | CONSUL (info1cup19_consul) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> //#include "grader.h" //#include "grader.cpp" using namespace std; void solve(int n) { int need=(n+2)/3; int arr[n+1]; for(int i=1; i <= n ; i++) { arr[i]=(kth(i)); } sort(arr+1, arr+n); int cn=1 , ans=-1; for(int i = 2 ; i<=n ; i++) { if(arr[i]==arr[i-1])cn++; else { if( (n%3==0&&cn>need) || (n%3!=0&&cn>=need)) { ans=arr[i-1]; break; } cn=1; } } if( (n%3==0&&cn>need) || (n%3!=0&&cn>=need)) { ans=arr[n]; } say_answer(ans); }