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 int co = 0, g, i, n, y, m, d, j, k, z, t, x = 0, a, b, c, l, r;
  cin >> n >> k;
  vector<long long int> ar;
  map<long long int, long long int> mp;
  for (i = 0; i < n; i++) {
    cin >> x;
    if (mp[x] == 0) ar.push_back(x);
    mp[x]++;
  }
  sort(ar.begin(), ar.end());
  for (i = 1; i < ar.size(); i++) {
    if (ar[i - 1] + k >= ar[i]) ar[i - 1] = -1;
  }
  co = 0;
  for (i = 0; i < ar.size(); i++) {
    if (ar[i] != -1) co += mp[ar[i]];
  }
  cout << co;
  return 0;
}
bool prime(long long int n) {
  bool x = true;
  int i;
  for (i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) {
      x = false;
    }
  }
  return x;
}
