#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int n = 0;
int dist = 0;
int xq[100001];
int main() {
	cin >> n >> dist;
	for (int i = 0; i < n; i++) {
		cin >> xq[i];
	}
	sort(xq, xq + n);
	int ans = 0;
	int j = 0;
	int z = xq[0] + dist;
	for (int i = 1; i < n - 1; i++) {
		if (xq[i] > z) {
			z = xq[i] + dist;
		}
		else {
			ans++;
		}
	}
	cout << ans << endl;
	return 0;
}