252862026-02-19 00:04:16999Háromszögekcpp17Accepted 40/40210ms2256 KiB
// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main() {
    int n,q;cin>>n>>q;
    vector<int> v(n),mv(n);
    for(int i = 0;i<n;i++){
        cin>>v[i];
        mv[i]=v[i]*-1;
    }
    sort(v.begin(),v.end());
    sort(mv.begin(),mv.end());
    while(q--){
        int a,b;cin>>a>>b;
        int A=abs(a-b);
        int i1=n-((upper_bound(mv.begin(),mv.end(),-1*(a+b))-mv.begin()));
        int i2=((upper_bound(v.begin(),v.end(),A)-v.begin()));
        cout<<max(i1-i2,0LL)<<endl;
    }
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/01ms512 KiB
2Accepted0/01ms316 KiB
3Accepted0/017ms564 KiB
4Accepted4/44ms316 KiB
5Accepted2/24ms508 KiB
6Accepted1/1199ms2244 KiB
7Accepted1/1189ms2236 KiB
8Accepted2/2184ms2236 KiB
9Accepted2/2186ms2100 KiB
10Accepted1/1175ms2104 KiB
11Accepted1/1173ms2100 KiB
12Accepted2/2180ms2244 KiB
13Accepted2/2180ms2236 KiB
14Accepted1/1202ms2100 KiB
15Accepted1/1195ms2216 KiB
16Accepted1/1195ms2100 KiB
17Accepted1/1189ms1976 KiB
18Accepted1/1177ms1980 KiB
19Accepted2/2178ms1984 KiB
20Accepted2/2186ms1980 KiB
21Accepted3/3185ms2092 KiB
22Accepted5/5202ms2100 KiB
23Accepted5/5210ms2256 KiB