Advertisement
YEZAELP

SMMR-165: Guk

Jun 22nd, 2020
146
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.42 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. int main(){
  4.  
  5.     int n;
  6.     long long d,cnt=0;
  7.     scanf("%d%lld",&n,&d);
  8.     long long ar[n+1];
  9.     for(int i=1;i<=n;i++){
  10.         scanf("%lld",&ar[i] );
  11.     }
  12.     sort(ar+1,ar+n+1);
  13.     int j=2;
  14.     for(int i=1;i<=n;i++){
  15.         while( j<=n and ar[j]-ar[i]<=d ){
  16.             cnt+=j-i;
  17.             j++;
  18.         }
  19.     }
  20.     printf("%lld",cnt);
  21.  
  22.     return 0;
  23. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement