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;
int n, k;
int a[200005];
int bs(int x) {
  int l = 0, r = n - 1;
  int m;
  while (l <= r) {
    m = (l + r) / 2;
    if (a[m] == x)
      return x;
    else if (a[m] > x)
      r = m - 1;
    else
      l = m + 1;
  }
  if (a[m] > x) m--;
  return a[m];
}
bool com(int x) {
  auto it = upper_bound(a, a + n, x);
  int y = it - a;
  y = a[y];
  if (x == a[n - 1]) y = x * 2;
  int b = bs(x + k);
  if (y <= b) return true;
  return false;
}
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a, a + n);
  int r = n;
  for (int i = 0; i < n; i++) {
    if (com(a[i])) r--;
  }
  cout << r << endl;
  return 0;
}
