개미 집합

#include <iostream>
#include <algorithm>
using namespace std;
int arr[100001];
int main() {
    int n, d, ans = 1000001;
    cin >> n >> d;
    for (int i = 0; i < n; i++) cin >> arr[i];
    sort(arr, arr + n);
    int i = 0, j = 0;
    while (j < n){
        if (arr[j] - arr[i] > d) i++;
        else{
            ans = min(ans, n+i-j);
            j++;
        }
    }
    cout << ans-1 << endl;
    return 0;
}