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 long long MAXN = 2e5 + 5, MAXK = 1e6 + 6;
int n, k, a, ans, size = 0;
int Arr[MAXN];
int Mark[MAXK];
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> a;
    if (!Mark[a]) Arr[size++] = a;
    Mark[a]++;
  }
  sort(Arr, Arr + size);
  for (int i = 0; i + 1 < size; i++)
    if (Arr[i + 1] - Arr[i] > 0 && Arr[i + 1] - Arr[i] <= k)
      ans += Mark[Arr[i]];
  cout << n - ans;
  return 0;
}
