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 int n, k, i, j;
  cin >> n >> k;
  long long int arr[n];
  set<long long int> s;
  set<long long int> s2;
  map<long long int, long long int> ans;
  for (i = 0; i < n; i++) {
    cin >> arr[i];
    s.insert(arr[i]);
    ans[arr[i]]++;
  }
  for (auto itr = s.begin(); itr != s.end(); itr++) {
    auto itr2 = itr;
    itr2++;
    if (itr2 != s.end()) {
      if (*itr + k >= (*itr2))
        continue;
      else
        s2.insert(*itr);
    } else
      s2.insert(*itr);
  }
  long long int ans2 = 0;
  for (auto itr = s2.begin(); itr != s2.end(); itr++) {
    ans2 += ans[*itr];
  }
  cout << ans2;
}
