Submission #7,394

2024-01-08 13:36:08

cpp17

Accepted 40/40

61ms

5948 KiB

#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define FastIO ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
using namespace std;
typedef long long ll;
int main() {
    FastIO;
    ll i, a, b, b1, b2, N, Q;
    cin >> N >> Q;
    vector<ll> A(N);
    for(i = 0; i < N; i++)
        cin >> A[i];
    sort(all(A));
    for(i = 0; i < Q; i++) {
        cin >> a >> b;
        b1 = upper_bound(all(A), a + b - 1) - A.begin();
        b2 = lower_bound(A.begin(), A.begin() + b1, abs(a - b) + 1) - A.begin();
        cout << b1 - b2 << '\n';
    }
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	40/40
		1	Accepted	0/0	3ms	1828 KiB
		2	Accepted	0/0	3ms	2020 KiB
		3	Accepted	0/0	7ms	2468 KiB
		4	Accepted	4/4	3ms	2448 KiB
		5	Accepted	2/2	3ms	2552 KiB
		6	Accepted	1/1	52ms	4240 KiB
		7	Accepted	1/1	46ms	4456 KiB
		8	Accepted	2/2	46ms	4772 KiB
		9	Accepted	2/2	46ms	4660 KiB
		10	Accepted	1/1	52ms	4864 KiB
		11	Accepted	1/1	50ms	5080 KiB
		12	Accepted	2/2	50ms	5344 KiB
		13	Accepted	2/2	50ms	5540 KiB
		14	Accepted	1/1	59ms	5460 KiB
		15	Accepted	1/1	52ms	5680 KiB
		16	Accepted	1/1	52ms	5628 KiB
		17	Accepted	1/1	48ms	5640 KiB
		18	Accepted	1/1	45ms	5672 KiB
		19	Accepted	2/2	45ms	5572 KiB
		20	Accepted	2/2	46ms	5572 KiB
		21	Accepted	3/3	46ms	5840 KiB
		22	Accepted	5/5	57ms	5948 KiB
		23	Accepted	5/5	61ms	5844 KiB