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>
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast")
using namespace std;
void timestamp(char const* const tag, bool absolute = false);
size_t n;
int k;
vector<int> a;
void read() {
  cin >> n >> k;
  a.resize(n);
  for (auto& v : a) {
    cin >> v;
  }
}
void solve() {
  sort(a.begin(), a.end());
  int ans = static_cast<int>(n);
  size_t last_surviving = 0;
  for (size_t curr = 0; curr < n; ++curr) {
    while (a[last_surviving] < a[curr] - k) {
      ++last_surviving;
    }
    while (a[last_surviving] < a[curr]) {
      ++last_surviving;
      --ans;
    }
  }
  cout << ans << endl;
}
void timestamp(char const* const tag, bool absolute) {
  static double last = 0;
  double now = (static_cast<double>(clock()) / CLOCKS_PER_SEC) * 1000;
  if (absolute) {
    ;
  } else {
    ;
    last = now;
  }
}
int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);
  timestamp("start");
  read();
  timestamp("read()");
  solve();
  timestamp("solve()");
  timestamp("total", true);
  return 0;
}
