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;
long long BigMod(long long N, long long P) {
  if (P == 0) return 1;
  if (P % 2 == 0) {
    long long ret = BigMod(N, P / 2);
    return ((ret % 1000000007) * (ret % 1000000007)) % 1000000007;
  } else
    return ((N % 1000000007) * (BigMod(N, P - 1) % 1000000007)) % 1000000007;
}
int a[200005];
int biS(int key, int mx, int lo, int hi) {
  int id;
  do {
    id = (lo + hi) / 2;
    if (a[id] > key) {
      if (a[id] > mx) {
        hi = id - 1;
      } else {
        return 1;
      }
    } else {
      lo = id + 1;
    }
  } while (lo <= hi);
  return 0;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long n, K;
  while (cin >> n >> K) {
    for (int i = 1; i <= n; i++) {
      cin >> a[i];
    }
    sort(a + 1, a + n + 1);
    long long ans = n;
    for (int i = 1; i <= n; i++) {
      int x = a[i] + K;
      if (biS(a[i], x, 1, n)) {
        ans--;
      }
    }
    cout << ans << endl;
  }
  return 0;
}
