#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, count = 0;
  cin >> n >> k;
  int arr[n];
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  sort(arr, arr + n);
  vector<pair<int, int>> vec;
  vec.push_back(make_pair(arr[0], 1));
  for (int i = 1; i < n; i++) {
    if (arr[i] == vec.back().first)
      vec.back().second++;
    else
      vec.push_back(make_pair(arr[i], 1));
  }
  n = vec.size();
  for (int i = 0; i < n - 1; i++) {
    if (vec.at(i).first + k < vec.at(i + 1).first) count += vec.at(i).second;
  }
  count += vec.back().second;
  cout << count << endl;
}
