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() {
  vector<long long> ar;
  long long n, k;
  cin >> n >> k;
  long long i;
  for (i = 0; i < n; i++) {
    long long x;
    cin >> x;
    ar.push_back(x);
  }
  sort(ar.begin(), ar.end());
  long long n1 = ar.size() - 2;
  long long n2, cnt = 0;
  for (n2 = ar.size() - 1; n2 >= 0; n2--) {
    if (n1 == n2) n1--;
    while (n1 >= 0 && ar[n2] - ar[n1] <= k && ar[n1] != ar[n2]) {
      n1--;
      cnt++;
    }
  }
  cout << n - cnt;
}
