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;
long long n, m, x, y, z, w, k, h[300000], a[300000];
string s;
long long bs(long long xx, long long yy, long long kk) {
  long long mm = (xx + yy) / 2;
  if (yy - xx <= 1) return xx;
  if (a[mm] <= kk)
    return bs(mm, yy, kk);
  else
    return bs(xx, mm, kk);
}
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  for (int i = n - 1; i >= 0; i--) {
    x = bs(0, n, a[i] - k);
    while (a[i] - k > a[x]) x++;
    while (x != 0 && a[x - 1] == a[x]) x--;
    for (int j = x; j < i; j++) {
      if (a[i] == a[j]) break;
      if (h[j] == 1) break;
      h[j] = 1;
    }
  }
  for (int i = 0; i < n; i++) {
    if (h[i] == 0) y++;
  }
  cout << y;
  return 0;
}
