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;
int main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long n, k;
  cin >> n >> k;
  long long a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  vector<pair<long long, long long> > v;
  map<long long, long long> m;
  map<long long, long long>::iterator it;
  for (int i = 0; i < n; i++) m[a[i]]++;
  for (it = m.begin(); it != m.end(); it++)
    v.push_back({it->first, it->second});
  long long x = v.size();
  long long res = n;
  for (int i = 0; i < x - 1; i++) {
    if (v[i + 1].first <= v[i].first + k) res -= v[i].second;
  }
  cout << res << "\n";
}
