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 + 10;
int num[MAXN];
bool mark[MAXN];
bool comp(int a, int b) { return a > b; }
int main(void) {
  int n, k;
  cin >> n >> k;
  for (int i = 1; i <= n; i++) cin >> num[i];
  sort(num + 1, num + n + 1, comp);
  int ans = n;
  for (int i = n - 1; i >= 1; i--) {
    if (num[i] == num[i + 1]) continue;
    int j;
    for (j = i + 1; j <= n && num[i] - num[j] <= k && !mark[j]; j++)
      ans--, mark[j] = 1;
  }
  cout << ans << "\n";
}
