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 MAXN = 2e5 + 5;
int A[MAXN], N, K;
int main() {
  scanf("%d %d", &N, &K);
  for (int i = 1; i <= N; ++i) scanf("%d", &A[i]);
  if (N == 1) {
    puts("1");
    return 0;
  }
  sort(A + 1, A + N + 1);
  int left = 1, right = 2, cnt = 0;
  while (right <= N) {
    if (A[left] == A[right]) {
      while (A[left] == A[right]) right++;
    } else {
      if (left == right)
        right++;
      else {
        if (A[right] <= A[left] + K)
          cnt++, left++;
        else
          left++;
      }
    }
  }
  printf("%d\n", N - cnt);
  return 0;
}
