Submission #23,835

2026-01-30 15:45:51

cpp17

Accepted 40/40

195ms

1076 KiB

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

int main()
{
    int n,q;
    cin>>n>>q;
    vector<int> a(n);
    for(int &x:a)cin>>x;
    sort(a.begin(),a.end());
    long long x,y;
    for(int i=0;i<q;i++)
        {
        cin>>x>>y;
        long long L,R;
        L=max(x,y)-min(x,y);
        R=x+y;
        cout<<abs(upper_bound(a.begin(),a.end(),L)-lower_bound(a.begin(),a.end(),R))<<"\n";
        }
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	40/40
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	1ms	316 KiB
		3	Accepted	0/0	17ms	316 KiB
		4	Accepted	4/4	4ms	332 KiB
		5	Accepted	2/2	3ms	316 KiB
		6	Accepted	1/1	190ms	1060 KiB
		7	Accepted	1/1	180ms	1052 KiB
		8	Accepted	2/2	175ms	1060 KiB
		9	Accepted	2/2	181ms	1056 KiB
		10	Accepted	1/1	173ms	1076 KiB
		11	Accepted	1/1	165ms	820 KiB
		12	Accepted	2/2	172ms	1060 KiB
		13	Accepted	2/2	167ms	1056 KiB
		14	Accepted	1/1	194ms	1056 KiB
		15	Accepted	1/1	181ms	820 KiB
		16	Accepted	1/1	187ms	804 KiB
		17	Accepted	1/1	193ms	800 KiB
		18	Accepted	1/1	175ms	796 KiB
		19	Accepted	2/2	174ms	820 KiB
		20	Accepted	2/2	175ms	804 KiB
		21	Accepted	3/3	184ms	820 KiB
		22	Accepted	5/5	195ms	1068 KiB
		23	Accepted	5/5	195ms	1076 KiB