Submission #1,918

1918

2022-12-10 00:35:09

cpp11

Accepted 40/40

158ms

5572 KiB

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long
int main()
{
    cin.tie(nullptr);
    cout.tie(nullptr);
    ios_base::sync_with_stdio(false);
    int n, q;
    cin >> n >> q;
    vector<ll>vec(n);
    for (size_t i = 0; i < n; i++) cin >> vec[i];
    sort(vec.begin(), vec.end());
    while (q--)
    {
        ll b, c;
        cin >> b >> c;
        auto l = lower_bound(vec.begin(), vec.end(), abs(c - b) + 1);
        auto r = upper_bound(l, vec.end(), b + c - 1);
        cout << r - l << endl;
    }
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	40/40
		1	Accepted	0/0	3ms	1700 KiB
		2	Accepted	0/0	2ms	1860 KiB
		3	Accepted	0/0	10ms	2272 KiB
		4	Accepted	4/4	4ms	2284 KiB
		5	Accepted	2/2	4ms	2488 KiB
		6	Accepted	1/1	144ms	4156 KiB
		7	Accepted	1/1	157ms	4360 KiB
		8	Accepted	2/2	86ms	4676 KiB
		9	Accepted	2/2	101ms	5000 KiB
		10	Accepted	1/1	98ms	4832 KiB
		11	Accepted	1/1	150ms	4712 KiB
		12	Accepted	2/2	98ms	4748 KiB
		13	Accepted	2/2	120ms	4940 KiB
		14	Accepted	1/1	104ms	4888 KiB
		15	Accepted	1/1	153ms	4952 KiB
		16	Accepted	1/1	150ms	5204 KiB
		17	Accepted	1/1	87ms	5204 KiB
		18	Accepted	1/1	158ms	5092 KiB
		19	Accepted	2/2	144ms	5160 KiB
		20	Accepted	2/2	143ms	5092 KiB
		21	Accepted	3/3	136ms	5348 KiB
		22	Accepted	5/5	156ms	5292 KiB
		23	Accepted	5/5	131ms	5572 KiB