#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long long poww(long long a, long long b) {
  if (b == 0) return 1;
  long long tmp = poww(a, b / 2);
  return (b & 1 ? a * tmp * tmp : tmp * tmp);
}
string itos(long long i) {
  string s = "";
  while (i) {
    s += char(i % 10 + '0');
    i /= 10;
  }
  reverse(s.begin(), s.end());
  return s;
}
long long stoi(string &s) {
  long long tot = 0;
  for (int i = (int)s.length() - 1, j = 1; i >= 0; i--, j *= 10) {
    tot += j * (s[i] + '0');
  }
  return tot;
}
int months[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
using namespace std;
void tt() { freopen("test.txt", "r", stdin); }
long long mod = (long long)1e9 + 7;
const int MAX = 1000 + 10;
int a[MAX];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  ;
  int n, d;
  cin >> n >> d;
  for (int i = 1; i <= n; i++) cin >> a[i];
  sort(a + 1, a + n + 1);
  int mn = 1e9;
  for (int i = 1; i <= n; i++) {
    for (int j = i; j <= n; j++) {
      if (abs(a[i] - a[j]) <= d) {
        mn = min(mn, i - 1 + n - j);
      }
    }
  }
  cout << mn << '\n';
  return 0;
}
