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() {
  long long n, k;
  cin >> n >> k;
  long long a[n];
  for (long long i = 0; i < (n); i++) cin >> a[i];
  if (n == 1) {
    cout << 1 << endl;
    return 0;
  }
  sort(a, a + n);
  long long ans = 0, dup = 0;
  long long i = 0, j = 1;
  while (i < n && j < n) {
    while (a[i + 1] == a[i]) {
      i++;
      dup++;
    }
    while (a[j] - a[i] <= k) {
      j++;
    }
    if (j - 1 != i && a[j - 1] != a[i]) {
      ans += j - i - 1 + dup;
      i = j - 1;
      dup = 0;
    } else {
      i++;
      j++;
    }
  }
  cout << n - ans << endl;
  return 0;
}
