#include <bits/stdc++.h>
using namespace std;

#define loop(i,b,e) for(int i=b;i<=e;i++)
#define reloop(i,e,b) for(int i=e;i>=b;i--)
#define all(x) x.begin(),x.end()
#define pb push_back
#define ll long long
#define pf printf
#define sf scanf

int n,d,b,e,v[101],ans=1e6;

int main() {
   sf("%d%d",&n,&d);
   loop(i,0,n-1)
      sf("%d",&v[i]);
   if(d == 0) {
      pf("0");
      return 0;
   }
   sort(v,v+n);
   loop(i,0,n-1) {
      loop(j,0,n-1) {
         if(v[i]-v[j] == d) {
            b = i;
            e = j;
            ans = min(ans,n-b+e-1);
            //pf("%d %d\n",v[i],v[j]);
         }
      }
   }
   pf("%d",ans);
}