#include<iostream>
#include<algorithm>
using namespace std;

int n , p[100000001] , dist , ans;

int main()
{
	cin >> n >> dist;
	for(int i = 1; i <= n; ++i) {
		cin >> p[i];
	} 
	sort(p + 1, p + n + 1);
	for(int i = 2; i < n; ++i) {
		if(p[i] - p[i - 1] <= dist) {
			p[i] = p[i - 1];ans++;
		}
	}
	cout << ans;
	return 0;
}