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>
const int con = 10e6 + 4;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n, k, arr[333333];
  vector<int> v;
  cin >> n >> k;
  for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
  sort(arr, arr + n);
  int a = 0, b = 0, ans = 0;
  while (b != n) {
    if (a == b) b++;
    if (arr[b] > arr[a] && arr[a] + k >= arr[b]) {
      ans++;
      a++;
      for (auto x : v) {
        if (arr[b] > x && x + k >= arr[b]) ans++;
      }
      v.clear();
    } else {
      v.push_back(arr[a]);
      a++;
    }
  }
  cout << n - ans << endl;
}
