#include <bits/stdc++.h>
using namespace std;
int count( vector<int> &arr,int k){
int c=0;
unordered_map<int , int> m;
for(int i=0;i<arr.size();i++){
int t=arr[i]+k;
if(m.find(t)!=m.end()){
c+=m[t];
}
m[arr[i]]++;
}
return c;
}
int main() {
vector<int> b = {1, 5, 3, 4, 2};
int k = 2;
cout << "Count of pairs: " << count(b, k) << endl;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBjb3VudCggdmVjdG9yPGludD4gJmFycixpbnQgayl7CglpbnQgYz0wOwoJdW5vcmRlcmVkX21hcDxpbnQgLCBpbnQ+IG07Cglmb3IoaW50IGk9MDtpPGFyci5zaXplKCk7aSsrKXsKCQlpbnQgdD1hcnJbaV0razsKCQlpZihtLmZpbmQodCkhPW0uZW5kKCkpewoJCQljKz1tW3RdOwoJCX0KCQltW2FycltpXV0rKzsKCX0KCXJldHVybiBjOwp9CmludCBtYWluKCkgewogICAgdmVjdG9yPGludD4gYiA9IHsxLCA1LCAzLCA0LCAyfTsKICAgIGludCBrID0gMjsKICAgIGNvdXQgPDwgIkNvdW50IG9mIHBhaXJzOiAiIDw8IGNvdW50KGIsIGspIDw8IGVuZGw7CiAgICByZXR1cm4gMDsKfQogCg==