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 a[200000];
vector<pair<int, int> > v;
int main() {
  int i, j, n, K;
  scanf("%d%d", &n, &K);
  for (i = 0; i < n; i++) scanf("%d", &a[i]);
  sort(a, a + n);
  int ind_low = 0, ind_high = 0;
  for (i = 1; i < n; i++) {
    int ele = a[i];
    for (j = ind_low; j <= i; j++) {
      if (a[j] >= ele - K) {
        ind_low = j;
        break;
      }
    }
    for (j = ind_high; j <= i; j++) {
      if (a[j] >= ele) {
        ind_high = j - 1;
        break;
      }
    }
    if (ind_high >= ind_low) v.push_back(make_pair(ind_low, ind_high));
  }
  int sz = v.size();
  if (sz == 0)
    printf("%d\n", n);
  else {
    int ans;
    for (i = 0; i < sz; i++) {
      int low = v[i].first, prev_high = v[i - 1].second;
      if (i == 0)
        ans = low;
      else if (low > prev_high + 1)
        ans += (low - prev_high - 1);
    }
    ans += (n - 1 - v[sz - 1].second);
    printf("%d\n", ans);
  }
  return 0;
}
