#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
bool cmp(pair<long long, long long> p1, pair<long long, long long> p2) {
  if (p1.first == p2.first) return p1.second < p2.second;
  return abs(p1.first - p1.second) < abs(p2.first - p2.second);
}
int32_t main() {
  long long n, k;
  cin >> n >> k;
  long long a[n];
  for (long long i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n, greater<long long>());
  long long p1 = 0, p2 = 1;
  long long count = 0;
  while (p1 != n - 1) {
    if ((a[p1] > a[p2]) && (a[p1] <= a[p2] + k)) {
      count++;
      p2++;
    } else
      p1++;
    if (p1 == p2) p2++;
  }
  cout << n - count << endl;
  return 0;
}
