#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
#define FOR(i, j, k) for (int i = j, Z = k; i < Z; i++)
mt19937 rnd(time(nullptr));
void solve(int n) {
if (n <= 50) {
map<int, int> M;
FOR(i, 1, n + 1) {
int x = kth(i);
if (++M[x] > n / 3) {
say_answer(x);
return;
}
}
say_answer(-1);
return;
}
vector<int> v;
set<int> S;
FOR(i, 1, n + 1) v.push_back(i);
shuffle(v.begin(), v.end(), rnd);
int bound = 100, p = 0;
while (bound > 0) {
int id = v[p];
int x = kth(id);
bound--;
if (S.insert(x).sc) {
int y = cnt(x);
bound--;
if (y > n / 3) {
say_answer(x);
return;
}
}
}
say_answer(-1);
return;
}
Compilation message
consul.cpp: In function 'void solve(int)':
consul.cpp:30:25: error: 'struct std::pair<std::_Rb_tree_const_iterator<int>, bool>' has no member named 'sc'
30 | if (S.insert(x).sc) {
| ^~
