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;
const int N = 1e5 + 10;
long long n, k, a[N + N], us[N + N], ans, mx = N * 100 * -1, mxx[N + N];
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    mx = max(a[i], mx);
  }
  sort(a + 1, a + n + 1);
  for (int i = n; i >= 1; --i) {
    if (mx == a[i]) {
      mxx[i] = 1;
    } else {
      break;
    }
  }
  for (int i = 1; i <= n; ++i) {
    long long f;
    if (a[i] + k > mx) {
      f = mx;
    } else {
      f = a[i] + k;
    }
    long long t = *lower_bound(a + 1, a + n + 1, f);
    if (a[i] < t && f >= t) {
      us[i] = 1;
    }
  }
  for (int i = 1; i <= n; ++i) {
    if (!us[i]) {
      ++ans;
    }
  }
  cout << ans;
  return 0;
}
