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;
struct Ha {
  int pos, num;
} ha[2000050];
int n, k, a[2000050], ans = 0, cnt = 0;
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  sort(a + 1, a + n + 1);
  int no = 0;
  for (int i = 1; i <= n; i++) {
    if (a[i] != no) {
      ha[++cnt].pos = a[i];
      ha[cnt].num = 1;
      no = a[i];
    } else
      ha[cnt].num++;
  }
  ha[++cnt].pos = 10000000;
  no = 1;
  for (int i = 1; i <= cnt; i++) {
    if (ha[i].pos == ha[no].pos) continue;
    if (ha[i].pos - k > ha[no].pos) ans += ha[no].num;
    no = i;
  }
  printf("%d", ans);
  return 0;
}
