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 head;
int N, K;
int num[200020];
void test() {
  for (int i = 0; i < N; i++) {
    cout << num[i] << " ";
  }
  cout << endl;
}
int main() {
  cin >> N >> K;
  int ans = 0;
  for (int i = 0; i < N; i++) {
    scanf("%d", &num[i]);
  }
  sort(num, num + N);
  for (int tail = 1; tail < N; tail++) {
    if (num[tail] > num[tail - 1] && num[tail] <= num[tail - 1] + K) {
      ans++;
    }
  }
  cout << N - ans << endl;
  return 0;
}
