#include<iostream>
#include<algorithm>
using namespace std;
int p[100005],dist,ans,n,lastb=1;
int main(){
	cin>>n>>dist;
	for(int i=1;i<=n;i++){
		cin>>p[i];
	}
	sort(p+1,p+1+n);
	for(int i=2;i<n;i++){
		if(p[i]-p[lastb]<=dist||p[n]-p[lastb]<=dist)ans++;
		else ans--,i--,lastb=i;
	}
	cout<<ans;
	return 0;
}