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;
const int N = 2e5 + 5;
vector<int> a;
int b[N];
int main() {
  int n, ans, k, x;
  cin >> n >> k;
  ans = n;
  for (int i = 1; i <= n; ++i) {
    cin >> x;
    a.push_back(x);
  }
  sort(a.begin(), a.end());
  for (int i = 0; i < a.size(); i++) {
    int pos1 = upper_bound(a.begin(), a.end(), a[i]) - a.begin();
    int pos2 = upper_bound(a.begin(), a.end(), a[i] + k) - a.begin() - 1;
    if (pos2 < pos1) continue;
    if (pos2 != i && pos1 != i) b[i] = 1;
  }
  for (int i = 0; i < a.size(); i++) {
    if (b[i]) {
      ans--;
    }
  }
  cout << ans;
}
