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() {
  long long n, k;
  map<long long, long long> vect;
  cin >> n >> k;
  long long a;
  while (n--) {
    cin >> a;
    vect[a]++;
  }
  map<long long, long long>::iterator it = vect.begin();
  while (1) {
    if (vect.size() == 1) break;
    map<long long, long long>::iterator it2 = ++it;
    it--;
    if (it2 == vect.end()) break;
    long long q = it->first;
    long long r = it2->first;
    if (q < r && q + k >= r) {
      vect[it->first] = 0;
    }
    it++;
  }
  long long ans = 0;
  for (it = vect.begin(); it != vect.end(); it++) {
    ans += it->second;
  }
  cout << ans << endl;
}
