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;
const double PI = acos(-1.0);
const int MOD = 1e9 + 7;
int n, K;
int a[MAXN];
vector<pair<int, int>> segs;
int main() {
  scanf("%d%d", &n, &K);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &a[i]);
  }
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; ++i) {
    int L = 1, R = i;
    if (a[i - 1] == a[i]) {
      segs.emplace_back(i, i);
      continue;
    }
    while (L < R) {
      int mid = (L + R) / 2;
      if (a[mid] == a[i] || a[i] - a[mid] > K)
        L = mid + 1;
      else
        R = mid;
    }
    segs.emplace_back(R, i);
  }
  sort(segs.begin(), segs.end());
  int res = 1;
  int rmax = 0;
  for (int i = 0; i < n - 1; ++i) {
    rmax = max(rmax, segs[i].second);
    if (rmax < segs[i + 1].first) {
      ++res;
    }
  }
  printf("%d", res);
  return 0;
}
