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 main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long n, k;
  cin >> n >> k;
  if (n == 1) {
    cout << "1" << endl;
    return 0;
  }
  std::vector<long long> a;
  long long temp;
  for (long long i = 0; i < n; i++) {
    cin >> temp;
    a.push_back(temp);
  }
  sort(a.begin(), a.end());
  long long j = 1, l = 0;
  while (true) {
    if ((a[j] - a[l] <= k) && (a[j] > a[l])) {
      a[l] = 0;
      l = l + 1;
      if (j == l) j++;
    }
    if (j == n) break;
    if (a[j] - a[l] > k) {
      l = l + 1;
      if (j == l) j++;
    }
    if (j == n) break;
    if (a[j] <= a[l]) j++;
    if (j == n) break;
  }
  long long count = 0;
  for (long long i = 0; i < n; i++) {
    if (a[i] != 0) count++;
  }
  cout << count << endl;
}
