#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:336777216")
using namespace std;
const double pi = atan((double)1.0) * 4;
long long MOD = (long long)1e9 + 7;
long long power(long long n, long long k) {
  if (k == 0)
    return 1;
  else if (k == 1)
    return n;
  else {
    if (k % 2 == 0) {
      return power((n * n) % MOD, k / 2);
    } else {
      return (power((n * n) % MOD, k / 2) * n) % MOD;
    }
  }
}
long long modInv(long long n) { return power(n, MOD - 2); }
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
template <class T>
bool reverse_sort(T a, T b) {
  return a > b;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, K;
  cin >> n >> K;
  map<long long, long long> arr;
  for (int i = 0; i < n; i++) {
    long long k;
    cin >> k;
    arr[k] += 1;
  }
  long long ans = n;
  for (auto it = arr.begin(); it != arr.end(); it++) {
    auto jt = it;
    jt++;
    if (jt == arr.end()) break;
    if (jt->first - it->first <= K) ans -= it->second;
  }
  cout << ans;
  return 0;
}
