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>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
double pi = 3.1415926535898;
string ys = "Yes\n";
string no = "No\n";
const double EPS = 1e-6;
const int inf = 2e9;
const long long M = 998244353;
const int N = 100100;
int n, k;
int a[200200];
map<int, int> mp;
vector<int> v;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  cin >> n >> k;
  for (int i = 1; i <= int(n); i++) cin >> a[i];
  for (int i = 1; i <= int(n); i++) mp[a[i]]++;
  sort(a + 1, a + n + 1);
  v.push_back(a[1]);
  for (int i = 2; i <= int(n); i++) {
    if (a[i] != a[i - 1]) {
      v.push_back(a[i]);
    }
  }
  int ans = 0;
  int lst = n;
  for (int i = 0; i < int(v.size()); i++) {
    if (v[i + 1] > v[i] && v[i + 1] <= v[i] + k) {
      ans += mp[v[i]];
    }
  }
  cout << n - ans << endl;
}
