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;
  cin >> n >> k;
  long long int a[n];
  long long int i = 0;
  while (i < n) {
    cin >> a[i];
    i++;
  }
  sort(a, a + n);
  vector<long long int> v;
  vector<long long int> v1;
  i = 0;
  long long int count = 0;
  while (i < n) {
    count = 1;
    v1.push_back(a[i]);
    while (i < n - 1 and a[i] == a[i + 1]) {
      count++;
      i++;
    }
    v.push_back(count);
    i++;
  }
  i = 1;
  count = 0;
  while (i < v.size()) {
    if (v1[i] > v1[i - 1] and v1[i] - v1[i - 1] <= k) count += v[i - 1];
    i++;
  }
  cout << n - count;
}
