提出 #72361247

---

ソースコード 拡げる

#include <iostream>
#include <vector>
#include <algorithm>
#define fastio cin.tie(0)->sync_with_stdio(0)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define compress(v) sort(all(v)), v.erase(unique(all(v)), v.end())
#define sz(x) (int)(x).size()
using namespace std;

typedef long long ll;
int main() {
    fastio; int N, Q; cin >> N >> Q;
    vector<ll> A(N+1);
    for (int i = 1; i <= N; i++) {
        cin >> A[i];
    }
    sort(all(A));
    vector<ll> fs(N+1);
    for (int i = 1; i <= N; i++) fs[i] = A[i]-A[i-1]-1;
    for (int i = 1; i <= N; i++) fs[i] += fs[i-1];
    for (int q = 0; q < Q; q++) {
        ll x, y; cin >> x >> y;
        ll idx = lower_bound(all(A), x) - A.begin() - 1;
        ll t = x - A[idx] - 1 + fs[idx];
        y += t;
        idx = lower_bound(all(fs), y) - fs.begin() - 1;
        y = y - fs[idx] + A[idx];
        cout << y << "\n";
    }
    return 0;
}

提出情報

ジャッジ結果