252842026-02-18 23:50:01999Háromszögekcpp17Wrong answer 0/40202ms2428 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);
        cout<<upper_bound(mv.begin(),mv.end(),-1*(a+b))-upper_bound(v.begin(),v.end(),A)-1<<endl;
    }
}
SubtaskSumTestVerdictTimeMemory
base0/40
1Accepted0/01ms500 KiB
2Wrong answer0/01ms316 KiB
3Wrong answer0/017ms564 KiB
4Wrong answer0/44ms508 KiB
5Wrong answer0/24ms316 KiB
6Wrong answer0/1199ms2240 KiB
7Wrong answer0/1185ms2240 KiB
8Wrong answer0/2189ms2428 KiB
9Wrong answer0/2185ms2236 KiB
10Wrong answer0/1179ms2356 KiB
11Wrong answer0/1172ms2100 KiB
12Wrong answer0/2180ms2232 KiB
13Wrong answer0/2180ms2240 KiB
14Wrong answer0/1202ms2356 KiB
15Wrong answer0/1188ms2236 KiB
16Wrong answer0/1193ms2240 KiB
17Wrong answer0/1194ms2356 KiB
18Wrong answer0/1180ms2236 KiB
19Wrong answer0/2179ms2356 KiB
20Wrong answer0/2186ms2340 KiB
21Wrong answer0/3185ms2240 KiB
22Wrong answer0/5194ms2244 KiB
23Wrong answer0/5201ms2228 KiB