import java.util.*;
import java.lang.*;
import java.io.*;

public class Main{

        static int smallestGreater(int[] arr, int k,int target)
        {
                int n=arr.length;
                int l=0,r=n-1;
                int ans=n;

                while(l<=r)
                        {
                                int mid=l+(r-l)/2;
                                if(arr[mid]>target)
                                {
                                        ans=mid;
                                        r=mid-1;
                                }
                                else
                                {
                                        l=mid+1;
                                }
                        }

                return ans;
        }

        public static void main(String[] args)
        {
                Scanner sc=new Scanner(System.in);
                int n=sc.nextInt();
                int k=sc.nextInt();
                int[] arr=new int[n];
                for(int i=0;i<n;i++)
                        {
                                arr[i]=sc.nextInt();
                        }

                Arrays.sort(arr);
                int ans=Integer.MAX_VALUE;

                for(int i=0;i<n;i++)
                        {
                                int x=smallestGreater(arr,k,arr[i]+k);
                                int deletions=i+n-x;
                                if(deletions<ans)ans=deletions;
                        }

                System.out.println(ans);
                return ;
        }
}