Submission #72369655

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define PII pair<ll,ll>
const int S = 1e9+50;
const ll INF = 0x3f3f3f3f3f3f3f3fLL;

void solve(){
	ll n, q;
	cin >> n >> q;
	vector<ll>ma(n);
	map<ll,ll>mp;
	for(int i = 0; i < n; i++){
		cin >> ma[i];
		mp[ma[i]]++;
	}
	sort(ma.begin(),ma.end());
	while(q--){
		ll x, y;
		cin >> x >> y;
		ll u = x + y - 1;
		ll a = lower_bound(ma.begin(),ma.end(),u) - ma.begin();
		ll b = lower_bound(ma.begin(),ma.end(),x) - ma.begin();
		ll c = a - b;
		u = u + c;
		if(mp[u] == 0){
			cout << u << endl;
			continue;
		}
		ll f = lower_bound(ma.begin(),ma.end(),u) - ma.begin();
		for(int i = f; i < n; i++){
			if(ma[i] != u){
				u++;
				break;
			}
			u++;
		}
		cout << u << endl;
	}
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr),cout.tie(nullptr);
	ll t = 1;
    //cin >> t;
    while(t--){
		solve();
	}
    return 0;
}

Submission Info

Judge Result