2 1
1 1
 4 1
2 2 1 1
 10 1
2 6 3 4 2 4 4 3 2 1
 2 1
999152 999153
 8 1000000
1 1 5 1000000 1000000 2 2 2
 9 2
1 6 1 5 5 8 6 8 7
 15 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
 1 4
8
 10 1
6 3 1 3 6 4 1 3 6 4
 10 1
1 2 3 5 6 8 10 11 9 4
 7 2
1 5 5 8 9 8 8
 2 1000000
1 1000000
 8 2
3 13 9 8 3 13 9 14
 1 1
1
 2 1
1 2

2
 2
 4
 1
 2
 4
 15
 1
 7
 2
 4
 1
 5
 1
 1

#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
template <typename T>
inline void write(T x) {
  long long i = 20;
  char buf[21];
  buf[20] = '\n';
  do {
    buf[--i] = x % 10 + '0';
    x /= 10;
  } while (x);
  do {
    putchar(buf[i]);
  } while (buf[i++] != '\n');
}
void read(long long &x) {
  bool neg = false;
  register long long c;
  x = 0;
  c = getchar();
  if (c == '-') {
    neg = true;
    c = getchar();
  }
  for (; (c > 47 && c < 58); c = getchar()) x = (x << 1) + (x << 3) + c - 48;
  if (neg) x *= -1;
}
int main() {
  long long n, k;
  cin >> n >> k;
  long long a[n];
  map<long long, long long> make_pair, mp2;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a, a + n);
  for (long long i = 0; i < n; i++) {
    long long diff = a[i] - k;
    long long lb = lower_bound(a, a + n, diff) - a;
    long long ub = lower_bound(a, a + n, a[i]) - a;
    if (lb == n or lb == ub) continue;
    if (make_pair[lb] < i or make_pair[lb] == 0) {
      make_pair[lb] = ub - 1;
    }
  }
  map<long long, long long>::iterator it = make_pair.begin(), lb, lb2;
  it = make_pair.begin();
  long long prev = -1, ans = 0;
  for (; it != make_pair.end(); it++) {
    if ((*it).first > prev)
      ans += (*it).second - (*it).first + 1;
    else if ((*it).first <= prev) {
      ans += (*it).second - prev;
    }
    prev = (*it).second;
  }
  cout << n - ans;
  return 0;
}
