Submission #34462643

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int main() {
  iostream::sync_with_stdio(0), cin.tie(0), cout.tie(0);

  int n, q;
  cin >> n >> q;
  vector<long long> A(n);
  for (int i = 0; i < n; i++) {
    cin >> A[i];
  }

  const long long N = (long long)1e18;
  while (q--) {
    long long k;
    cin >> k;
    long long low = 1, high = N;
    long long ans = -1;
    while (low <= high) {
      long long mid = (high - low) / 2 + low;
      int idx = lower_bound(A.begin(), A.end(), mid) - A.begin();
      bool in = idx < n && A[idx] == mid;
      long long how_many = mid - idx;
      if (!in && how_many == k) {
        ans = mid;
        break;
      }
      if (how_many <= k) {
        low = mid + 1;
      } else {
        high = mid - 1;
      }
    }
    cout << ans << '\n';
  }

  return 0;
}

Submission Info

Judge Result