Submission #72380023

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, Q;
    cin >> N >> Q;

    vector<long long> A(N);
    for (int i = 0; i < N; i++)
        cin >> A[i];

    sort(A.begin(), A.end());

    while (Q--) {
        long long X, Y;
        cin >> X >> Y;

        long long left = X, right = X + Y + N;
        long long ans = -1;

        while (left <= right) {
            long long mid = (left + right) / 2;

            long long present =
                lower_bound(A.begin(), A.end(), mid + 1) -
                lower_bound(A.begin(), A.end(), X);

            long long total = mid - X + 1;
            long long missing = total - present;

            if (missing >= Y) {
                ans = mid;
                right = mid - 1;
            } else
                left = mid + 1;
        }

        cout << ans << '\n';
    }

    return 0;
}

Submission Info

Judge Result