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 a[1000005];
int b[1000005];
int sum[1000005];
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  sort(a, a + n);
  for (int i = 1; i < n; i++) {
    int tmp = a[i] - k;
    if (tmp <= 0) tmp = 1;
    if (a[i - 1] + k < a[i]) continue;
    int x = lower_bound(a, a + i, tmp) - a;
    if (a[i - 1] >= a[i]) continue;
    if (x >= 0 && x <= i) {
      b[x] += 1;
      b[i] = -1;
    }
  }
  sum[0] = b[0];
  int cnt = 0;
  if (sum[0] == 0) cnt++;
  for (int i = 1; i < n; i++) {
    sum[i] = sum[i - 1] + b[i];
    if (sum[i] == 0) cnt++;
  }
  cout << cnt << endl;
  return 0;
}
