#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;
}
