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 mod = 1e9 + 7;
long long int gcd(long long int a, long long int b) {
  return b == 0 ? a : gcd(b, a % b);
}
long long int expo(long long int x, long long int y) {
  long long int res = 1;
  x = x % mod;
  while (y > 0) {
    if (y & 1) res = (res * x) % mod;
    y = y >> 1;
    x = (x * x) % mod;
  }
  return res;
}
void matmul(long long int a[][2], long long int b[][2]) {
  long long int tmp[2][2];
  for (int i = 0; i < 2; i++) {
    for (int j = 0; j < 2; j++) {
      tmp[i][j] = 0;
      for (int k = 0; k < 2; k++)
        tmp[i][j] = (tmp[i][j] + a[i][k] * b[k][j]) % mod;
    }
  }
  for (int i = 0; i < 2; i++)
    for (int j = 0; j < 2; j++) a[i][j] = tmp[i][j];
}
long long int fibo(int n) {
  if (n == 0)
    return 0;
  else if (n == 1)
    return 1;
  long long int T[2][2] = {{0, 1}, {1, 1}};
  long long int res[2][2] = {{1, 0}, {0, 1}};
  n--;
  while (n) {
    if (n & 1) matmul(res, T);
    n >>= 1;
    matmul(T, T);
  }
  return res[1][1];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n, k, i, cnt = 0;
  cin >> n >> k;
  vector<int> a;
  for (i = 0; i < n; i++) {
    int x;
    cin >> x;
    a.push_back(x);
  }
  sort((a).begin(), (a).end());
  multiset<int> s;
  multiset<int>::iterator it, itr;
  for (i = 0; i < n; i++) s.insert(a[i]);
  for (int i = 0; i < n; i++) {
    it = s.upper_bound(a[i]);
    if (it != s.end()) {
      if (*it <= a[i] + k) {
        s.erase(s.find(a[i]));
      }
    }
  }
  cout << ((int)(s).size());
  return 0;
}
