304951: CF940A. Points on the line
Memory Limit:256 MB
Time Limit:1 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
Points on the line
题意翻译
题目大意: 给你n个数,要使最大值与最小值之差小于等于d,最少应该删除几个数。 输入格式: 第一行n和d 第二行为输入的数 Translated by @logeadd题目描述
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 $ ?输入输出格式
输入格式
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<=x_{i}<=100 $ ) — the coordinates of the points.
输出格式
Output a single integer — the minimum number of points you have to remove.
输入输出样例
输入样例 #1
3 1
2 1 4
输出样例 #1
1
输入样例 #2
3 0
7 7 7
输出样例 #2
0
输入样例 #3
6 3
1 3 4 6 9 10
输出样例 #3
3