#include<cstdio>
#include<algorithm>
using namespace std;
#define F(i,a,b) for(int i=(a);i<=(b);++i)
int n,q,ans=0;
int a[100001];
int main(){scanf("%d%d",&n,&q);F(i,1,n) scanf("%d",a+i);sort(a+1,a+n+1);F(i,1,n){int xx=a[i], kk=-1;F(j,i,n){if(a[j]-xx>q) break;kk=j;}ans=max(ans,kk-i+1);}printf("%d",n-ans);return 0;
}

#include<cstdio>
#define ll long long
int n,k,A,B;
ll ans;
int main(){scanf("%d%d%d%d",&n,&k,&A,&B);if(k==1) {printf("%lld",(ll)(n-1)*A);return 0;}while(n!=1){int x=n/k*k;if(x==0) {ans+=(ll)(n-1)*A; break;}if(n!=x) ans+=(ll)(n-x)*A, n=x;else{x=n/k;if((ll)(n-x)*A<=B) ans+=(ll)(n-x)*A;else ans+=B;n=x;}}printf("%lld",ans);return 0;
}

#include<cstdio>
#define F(i,a,b) for(int i=(a);i<=(b);++i)
#define F2(i,a,b) for(int i=(a);i<(b);++i)
int n,k,tot;
int px[150];
bool used[150];
char str[100010],use[30];
char ans[100010];
int main(){scanf("%d%d",&n,&k);scanf("%s",str);F2(i,0,n) used[str[i]]=1;F(i,1,140) if(used[i]) use[++tot]=i;F(i,1,tot) px[use[i]]=i; if(k>n){printf("%s",str);F(i,n+1,k) printf("%c",use[1]);return 0;}F2(i,0,k) ans[i]=str[i]; ans[k]='\0';int x=k-1;while(px[ans[x]]==tot){ans[x]=use[1];--x;}ans[x]=use[px[ans[x]]+1];printf("%s",ans);return 0;
}

#include<cstdio>
#include<algorithm>
using namespace std;
#define F(i,a,b) for(int i=(a);i<=(b);++i)
int n,ansll=-1000000000,ansrr=1000000000;
int a[100001];
char b[100009];
int main(){scanf("%d",&n);F(i,1,n) scanf("%d",a+i);scanf("%s",b+1);F(i,5,n){if(b[i-4]==b[i-3]&&b[i-3]==b[i-2]&&b[i-2]==b[i-1]){if(b[i-1]=='0'){int x=max(max(max(max(a[i],a[i-1]),a[i-2]),a[i-3]),a[i-4]);if(b[i]=='1'){//l > max(a 1~5)ansll=max(ansll,x+1);}}else{int x=min(min(min(min(a[i],a[i-1]),a[i-2]),a[i-3]),a[i-4]);if(b[i]=='0'){//r < min(a 1~5)ansrr=min(ansrr,x-1);}}}}printf("%d %d",ansll,ansrr);return 0;
}

#include<cstdio>
#include<algorithm>
using namespace std;
#define F(i,a,b) for(int i=(a);i<=(b);++i)
#define ll long long
int n,c;
int a[100009],b[100009];
int que[100009],l=1,r=0;
ll sum,f[100009],g[100009];
int main(){scanf("%d%d",&n,&c);F(i,1,n) scanf("%d",a+i);F(i,1,n) sum+=a[i];if(c>n) {printf("%lld",sum); return 0;}F(i,1,c){while(l<=r&&a[que[r]]>=a[i]) --r;que[++r]=i;} b[1]=a[que[l]];F(i,c+1,n){if(que[l]<=i-c) ++l;while(l<=r&&a[que[r]]>=a[i]) --r;que[++r]=i;b[i-c+1]=a[que[l]];}F(i,1,n-c+1){if(i<=c) f[i]=b[i];else{f[i]=b[i]+g[i-c];}g[i]=max(g[i-1],f[i]);}printf("%lld",sum-g[n-c+1]);return 0;
}