92求调！必回关！二分还错了！！！！！！

#include<bits/stdc++.h>
using namespace std;
long long n,c,a[200001],ans; 
int main(){
    cin>>n>>c;
    for(int i=1;i<=n;i++){
    	cin>>a[i];
	}
	sort(a+1,a+n+1);
	for(int i=1;i<=n;i++){
		int l=i+1,r=n;
		while(l<=r){
			int middle=(l+r)/2;
			if(abs(a[i]-a[middle])==c){
				++ans;
				int x=middle-1;
				while(a[middle]==a[x]){
					++ans;
					x--;
				}
				int y=middle+1;
				while(a[middle]==a[y]){
					ans++;
					y++;
				} 
				break; 
			}else if(abs(a[i]-a[middle])>c){
				r=middle-1;
			}else{
				l=middle+1;
			}
		}
	}
	cout<<ans;
	return 0;
}