Codeforces Round #466 (Div. 2) A. [n个点，最少去掉多少个点使剩下的点的最大距离不超过k。]

A. Points on the line
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
We’ve got no test cases. A big olympiad is coming up. But the problemsetters’ number one priority should be adding another problem to the round.

The diameter of a multiset of points on the line is the largest distance between two points from this set. For example, the diameter of the multiset {1, 3, 2, 1} is 2.

Diameter of multiset consisting of one point is 0.

You are given n points on the line. What is the minimum number of points you have to remove, so that the diameter of the multiset of the remaining points will not exceed d?

Input
The first line contains two integers n and d (1 ≤ n ≤ 100, 0 ≤ d ≤ 100) — the amount of points and the maximum allowed diameter respectively.

The second line contains n space separated integers (1 ≤ xi ≤ 100) — the coordinates of the points.

Output
Output a single integer — the minimum number of points you have to remove.

Examples
Input
Copy
3 1
2 1 4
Output
1
Input
Copy
3 0
7 7 7
Output
0
Input
Copy
6 3
1 3 4 6 9 10
Output
3
【分析】
两个for循环，枚举每个点到其他的点的距离，如果距离小于等于d，则用left=i-1 表示当前位置前面需要删除的数的个数， right=n-i 表示当前位置后面需要删除的数的个数，同时，不断更新最小的 left+right；结果即答案！

#include<bits/stdc++.h>
using namespace std;
int a[105];
int main (){
    int minx=1000001;
    int n,d,i,j;
    int left,right;
    while(~scanf("%d%d",&n,&d)){
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i]);
        }
        sort(a+1,a+n+1);    //注意sort的排序区间
        for(i=1;i<=n;i++){
            for(j=i;j<=n;j++){
                if(a[j]-a[i]<=d){
                    minx=min(i-1+n-j,minx);
                }
            }
        }
        printf("%d\n",minx);
    }
}