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;
long long n, k;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> k;
  long long arr[n + 5];
  bool vis[n + 5];
  memset(vis, 0, sizeof(vis));
  for (int i = 1; i <= n; ++i) cin >> arr[i];
  int ptr = 2;
  sort(arr + 1, arr + 1 + n, greater<long long>());
  long long ans = 0;
  for (int i = 1; i <= n; ++i) {
    if (vis[i]) continue;
    ans++;
    while (ptr <= n && arr[i] <= arr[ptr] + k) {
      vis[ptr] = 1;
      ptr++;
    }
  }
  cout << ans << endl;
}
