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;
  cin >> n >> k;
  long long a[n];
  long long mmax = 0;
  map<long long, long long> m;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    mmax = max(mmax, a[i]);
  }
  sort(a, a + n);
  vector<long long> v(mmax + 1, 0);
  vector<long long> inp;
  inp.push_back(a[0]);
  v[a[0]]++;
  for (int i = 1; i < n; i++) {
    v[a[i]]++;
    if (a[i - 1] != a[i]) inp.push_back(a[i]);
  }
  long long cnt = 0;
  int l = 0, r = 1;
  int flag = 0;
  int nn = inp.size();
  while (l < nn && r < nn) {
    flag = 0;
    while (r < nn && inp[l] + k >= inp[r] && inp[l] < inp[r]) {
      if (inp[l] + k > inp[r]) cnt = cnt + v[inp[r]];
      r++;
      flag = 1;
    }
    if (!flag)
      r++;
    else
      cnt = cnt + v[inp[l]];
    l = r - 1;
  }
  cout << n - cnt;
  return 0;
}
