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;
using ll = long long;
const int MAXN = 200005;
int n, k, in[MAXN];
bool check(int id) {
  int v = in[id];
  int tmp = upper_bound(in, in + n + 1, v) - in;
  if (in[tmp] - v <= k) return true;
  return false;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  while (cin >> n >> k) {
    for (int i = 0; i < n; ++i) {
      cin >> in[i];
    }
    sort(in, in + n);
    in[n] = 20000000;
    int ret = 0;
    for (int i = 0; i < n; ++i) {
      if (check(i))
        continue;
      else
        ret++;
    }
    cout << ret << '\n';
  }
  return 0;
}
