#include <bits/stdc++.h>
using namespace std;
int getCount(int n,int k,vector<int>arr){
int i=0;
int count=0;
for(int j=0;i<n;i++){
int diff=arr[j]-arr[i];
while(diff>k){
i++;
diff=arr[j]-arr[i];
}
count=count+j-i+1;
}
return count-n;
}
int main() {
// your code goes here
int n;
cin>>n;
vector<int>arr(n,0);
for(int i=0;i<n;i++){
cin>>arr[i];
}
int k;
cin>>k;
sort(arr.begin(),arr.end()); //need to sort for j>i
cout<<"Count of pairs with difference<=k:"<<getCount(n,k,arr);
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBnZXRDb3VudChpbnQgbixpbnQgayx2ZWN0b3I8aW50PmFycil7CglpbnQgaT0wOwoJaW50IGNvdW50PTA7Cglmb3IoaW50IGo9MDtpPG47aSsrKXsKCQlpbnQgZGlmZj1hcnJbal0tYXJyW2ldOwoJCXdoaWxlKGRpZmY+ayl7CgkJCWkrKzsKCQkJZGlmZj1hcnJbal0tYXJyW2ldOwoJCX0KCQljb3VudD1jb3VudCtqLWkrMTsKCX0KCXJldHVybiBjb3VudC1uOwogCn0KIAppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCWludCBuOwoJY2luPj5uOwoJdmVjdG9yPGludD5hcnIobiwwKTsKCWZvcihpbnQgaT0wO2k8bjtpKyspewoJCWNpbj4+YXJyW2ldOwoJfQoJaW50IGs7CgljaW4+Pms7Cglzb3J0KGFyci5iZWdpbigpLGFyci5lbmQoKSk7IC8vbmVlZCB0byBzb3J0IGZvciBqPmkKIAoJY291dDw8IkNvdW50IG9mIHBhaXJzIHdpdGggZGlmZmVyZW5jZTw9azoiPDxnZXRDb3VudChuLGssYXJyKTsKCXJldHVybiAwOwp9