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 inf = 2 * (1e9) + 10;
const long long MOD = 998244353;
const int NMAX = 1000005;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
set<pair<int, int>> st;
int cnt[NMAX];
int n, k, a;
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; ++i) {
    cin >> a;
    cnt[a]++;
  }
  for (int i = 1; i <= 1000000; ++i) {
    if (cnt[i]) st.insert({i, cnt[i]});
  }
  int ans = 0;
  while (st.size() > 1) {
    pair<int, int> fst = *(st.begin());
    pair<int, int> snd = *(++st.begin());
    if (snd.first - fst.first <= k) {
      st.erase(st.begin());
    } else {
      ans += fst.second;
      st.erase(st.begin());
    }
  }
  cout << ans + ((*(st.begin())).second) << "\n";
  return 0;
}
