#include <bits/stdc++.h>
using namespace std;
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long n, K;
  cin >> n >> K;
  vector<long long> v(n);
  for (long long _i = 0; _i < (long long)v.size(); ++_i) cin >> v[_i];
  sort(v.begin(), v.end());
  long long res = 0;
  for (long long i = 0; i < n; ++i) {
    long long j = i, cnt = 0;
    while (v[j] == v[i]) {
      j++;
      if (j == n) break;
    }
    if (j == n)
      res += j - i;
    else if (v[i] + K < v[j])
      res += j - i;
    i = j - 1;
  }
  cout << res << endl;
  return 0;
}
