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 int N = 2e5 + 5;
int s[N];
int main() {
  int i, n, k, sum, ans = 0;
  cin >> n >> k;
  for (i = 1; i <= n; i++) scanf("%d", &s[i]);
  sort(s + 1, s + 1 + n);
  s[n + 1] = 1e9;
  i = 1;
  sum = 1;
  while (i <= n) {
    if (s[i + 1] == s[i])
      sum++;
    else {
      if (s[i + 1] <= (s[i] + k))
        sum = 1;
      else {
        ans += sum;
        sum = 1;
        i++;
      }
    }
    i++;
  }
  cout << ans;
  return 0;
}
