- #include<iostream>
- #include<cstdio>
- #include<cstring>
- #include<string>
- #include<algorithm>
- #include<cctype>
- #include<cmath>
- #include<cstdlib>
- #include<queue>
- #include<ctime>
- #include<vector>
- #include<set>
- #include<map>
- #include<stack>
- using namespace std;
- int a[500];
- int is[500];
- int main()
- { int n,d,i,j,k,ans=0;;
- cin>>n>>d;
- for(i=1;i<=n;i++){
- cin>>a[i];
- is[a[i]]++;
- }
- sort(a+1,a+n+1);
- for(i=1;i<=n;i++){
- int sum=0;
- for(j=0;j<=d;j++)
- if(is[a[i]+j])sum+=is[a[i]+j];
- ans=max(sum,ans);
- }
- cout<<n-ans<<endl;
- return 0;
- }
来源: http://www.bubuko.com/infodetail-2507101.html