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>
const long double eps = 1e-10;
const int MOD = 1000000007;
using namespace std;
int a[200005], K, n;
int main() {
  scanf("%d %d", &n, &K);
  for (int i = 0; i < n; ++i) scanf("%d", a + i);
  sort(a, a + n);
  int ret = 0;
  for (int i = 0; i < n - 1; ++i) {
    int b = a[i] + K;
    int low = i + 1, high = n;
    while (low <= high) {
      int mid = (low + high) >> 1;
      if (a[mid] == a[i]) {
        low = mid + 1;
        continue;
      }
      if (a[mid] > a[i] && a[mid] <= b) {
        ++ret;
        break;
      } else {
        high = mid - 1;
      }
    }
  }
  printf("%d\n", n - ret);
  return 0;
}
