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 bs(long long a[], long long n, long long k, long long i) {
  long long ind = -1, l = 0, h = i - 1, m;
  while (l <= h) {
    m = (l + h) / 2;
    if (a[i] > a[m] && a[i] <= a[m] + k) {
      ind = m;
      h = m - 1;
    } else
      l = m + 1;
  }
  return ind;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, k;
  cin >> n >> k;
  long long a[n];
  for (long long i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  long long cnt = 0, ind;
  vector<pair<long long, long long> > r;
  for (long long i = 1; i < n; i++) {
    ind = bs(a, n, k, i);
    if (ind != -1) r.push_back(pair<long long, long long>(ind, i - 1));
  }
  sort(r.begin(), r.end());
  stack<pair<long long, long long> > st;
  for (long long i = 0; i < r.size(); i++) {
    if (!st.size())
      st.push(r[i]);
    else if (st.top().second < r[i].first)
      st.push(r[i]);
    else if (st.top().second < r[i].second) {
      pair<long long, long long> p = st.top();
      st.pop();
      p.second = r[i].second;
      st.push(p);
    } else {
    }
  }
  while (st.size()) {
    for (long long i = st.top().first; i < st.top().second + 1; i++) a[i] = -1;
    st.pop();
  }
  for (long long i = 0; i < n; i++)
    if (a[i] == -1) cnt++;
  cout << n - cnt;
  return 0;
}
