#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef unordered_map<int,int> umap;
typedef long double ld;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define popcount __builtin_popcount
#define case cout<<"Case "<<__testcase-testcase<<": ";
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int testcase=1;
    //cin>>testcase;
    int __testcase=testcase;
    while(testcase--){
        int n,m,i,j,k;
        cin>>n;
        int L; cin>>L;
        vii a(n); for(auto &i: a) cin>>i;
        sort(a.begin(), a.end());
        int dp[n+5][2];
        vii d(n);
        for(i=0;i<n;i++){
            j=(int)(lower_bound(a.begin(),a.end(),a[i]+L)-a.begin());
            d[i]=j;
        }

        dp[n][0]=dp[n][1]=0;
        dp[n-1][0]=0;
        dp[n-1][1]=1;

        for(i=n-2;i>=0;i--){
            dp[i][1]=min(dp[i+1][0], dp[i+1][1])+1;
            j=d[i];
            dp[i][0]=min(dp[j][0], dp[j][1])+(j-i-1);
            //cout<<dp[i][0]<<" "<<dp[i][1]<<endl;
        }
        cout<<min(dp[0][0], dp[0][1])<<endl;
    }
}