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 = 1e6 + 1;
int T[N];
int occ[N];
bool done[N];
int main() {
  int n, k;
  scanf("%d %d", &n, &k);
  for (int i = 0; i < n; i++) {
    scanf("%d", &T[i]);
    occ[T[i]]++;
  }
  sort(T, T + n);
  stack<int> stk;
  int ans = n;
  for (int i = 0; i < n; i++) {
    if (done[T[i]]) continue;
    while (!stk.empty() && (T[i] - stk.top()) <= k)
      ans -= occ[stk.top()], stk.pop();
    stk.push(T[i]);
    done[T[i]] = 1;
  }
  printf("%d", ans);
  return 0;
}
