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 = 1e6 + 10;
const int INF = 0x3f3f3f3f;
int n, m;
int p[MAXN];
int tag[MAXN], pre[MAXN];
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << setprecision(10) << fixed;
  cin >> n >> m;
  for (int i = 0; i < n; i++) cin >> p[i];
  sort(p, p + n);
  int cnt = 0;
  for (int i = 0; i < n; i++) {
    int u = lower_bound(p, p + i, p[i] - m) - p;
    int v = lower_bound(p, p + i, p[i]) - p;
    cnt += (v - u);
    tag[u]++;
    tag[v]--;
  }
  for (int i = 0; i < n; i++) {
    if (!i)
      pre[i] = tag[i];
    else
      pre[i] = pre[i - 1] + tag[i];
    cnt -= max(pre[i] - 1, 0);
  }
  cout << n - cnt << endl;
  return 0;
}
