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::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n, k;
  cin >> n >> k;
  map<long long, long long> d;
  for (long long i = (0); i < (long long)(n); i++) {
    long long x;
    cin >> x;
    d[x]++;
  }
  long long total = n;
  for (auto &z : d) {
    long long x = z.first;
    auto it = d.lower_bound(x - k);
    vector<long long> erase;
    while (it->first < x) {
      total -= it->second;
      erase.push_back(it->first);
      it++;
    }
    for (auto &x : erase) {
      d.erase(x);
    }
  }
  printf("%lld\n", total);
}
