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 Getint() {
  char c = getchar();
  int ret = 0, f = 1;
  while (!isdigit(c)) {
    if (c == '-') f = -f;
    c = getchar();
  }
  while (isdigit(c)) ret = (ret << 1) + (ret << 3) + c - '0', c = getchar();
  return ret * f;
}
const int Maxn = 2e5 + 50;
int a[Maxn];
int n, k;
int main() {
  n = Getint(), k = Getint();
  for (int i = 1; i <= n; i++) a[i] = Getint();
  sort(a + 1, a + n + 1);
  int temp = 0;
  int i = 2, j = 1;
  for (; i <= n; i++) {
    while (a[j] + k >= a[i] && a[j] < a[i]) j++, temp++;
    while (a[j] != a[i]) j++;
  }
  cout << n - temp;
  return 0;
}
