binary_search.cpp

ll left = 0, right = max_n;
while (right - left > 1) {
  ll mid = (left + right) / 2;
  if (check(va, vf, mid, k)) {
    right = mid;
  } else {
    left = mid;
  }
}