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);
const double eps = 1e-11;
void fastIO() {
  std::ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
int n, k;
int v[1000007];
bool canBeEaten(int indx) {
  int st_indx = upper_bound(v, v + n, v[indx]) - v;
  if (st_indx == n) return false;
  int st = st_indx, en = n - 1, md;
  while (st <= en) {
    md = (st + en) >> 1;
    if (v[md] <= v[indx] + k) {
      return true;
    }
    en = md - 1;
  }
  return false;
}
int main() {
  fastIO();
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> v[i];
  sort(v, v + n);
  int res = n;
  for (int i = 0; i < n; i++) {
    if (canBeEaten(i)) res--;
  }
  cout << res << endl;
  return 0;
}
