#include<bits/stdc++.h>
using namespace std;
int countPairs(vector<int>&b,int k){
unordered_map<int,int>f;
int cnt=0;
for(int i=0;i<b.size();i++){
int req=b[i]-k;
if(f.find(req)!=f.end()){
cnt+=f[req];
}
f[b[i]]++;
}
return cnt;
}
int main(){
vector<int>b={5,3,6,2,5};int k=2;
cout<<countPairs(b,k)<<"\n";
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKaW50IGNvdW50UGFpcnModmVjdG9yPGludD4mYixpbnQgayl7CiAgICB1bm9yZGVyZWRfbWFwPGludCxpbnQ+ZjsKICAgIGludCBjbnQ9MDsKICAgIGZvcihpbnQgaT0wO2k8Yi5zaXplKCk7aSsrKXsKICAgICAgICBpbnQgcmVxPWJbaV0tazsKICAgICAgICBpZihmLmZpbmQocmVxKSE9Zi5lbmQoKSl7CiAgICAgICAgCWNudCs9ZltyZXFdOwogICAgICAgIH0KICAgICAgICBmW2JbaV1dKys7CiAgICB9CiAgICByZXR1cm4gY250Owp9CmludCBtYWluKCl7CiAgICB2ZWN0b3I8aW50PmI9ezUsMyw2LDIsNX07aW50IGs9MjsKICAgIGNvdXQ8PGNvdW50UGFpcnMoYixrKTw8IlxuIjsKICAgIHJldHVybiAwOwp9Cg==