D. Balanced Round

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are the author of a Codeforces round and have prepared n� problems you are going to set, problem i� having difficulty ai��. You will do the following process:

  • remove some (possibly zero) problems from the list;
  • rearrange the remaining problems in any order you wish.

A round is considered balanced if and only if the absolute difference between the difficulty of any two consecutive problems is at most k� (less or equal than k�).

What is the minimum number of problems you have to remove so that an arrangement of problems is balanced?

Input

The first line contains a single integer t� (1≤t≤10001≤�≤1000) --- the number of test cases.

The first line of each test case contains two positive integers n� (1≤n≤2⋅1051≤�≤2⋅105) and k� (1≤k≤1091≤�≤109) --- the number of problems, and the maximum allowed absolute difference between consecutive problems.

The second line of each test case contains n� space-separated integers ai�� (1≤ai≤1091≤��≤109) --- the difficulty of each problem.

Note that the sum of n� over all test cases doesn't exceed 2⋅1052⋅105.

Output

For each test case, output a single integer --- the minimum number of problems you have to remove so that an arrangement of problems is balanced.

Example

input

Copy

复制代码

7

5 1

1 2 4 5 6

1 2

10

8 3

17 3 1 20 12 5 17 12

4 2

2 4 6 8

5 3

2 3 19 10 8

3 4

1 10 5

8 1

8 3 1 4 5 10 7 3

output

Copy

复制代码
2
0
5
0
3
1
4

Note

For the first test case, we can remove the first 22 problems and construct a set using problems with the difficulties 4,5,64,5,6, with difficulties between adjacent problems equal to |5−4|=1≤1|5−4|=1≤1 and |6−5|=1≤1|6−5|=1≤1.

For the second test case, we can take the single problem and compose a round using the problem with difficulty 1010.

解题说明:此题是一道数学题,分析后能发现直接对数列排序,然后再遍历一遍找出符合两个数之间差 <= k 的元素数量是多少, 再用总数量减去符合两个数之间差 <= k 的元素最长连续数量。

cpp 复制代码
#include<bits/stdc++.h>
using namespace std;
int t, n, k, ans, temp, a[200000];
int main() 
{
	cin >> t;
	while (t--)
	{
		cin >> n >> k;
		for (int i = 0; i < n; i++)
		{
			cin >> a[i];
		}
		sort(a, a + n);
		temp = 1;
		ans = 1;
		for (int i = 1; i < n; i++) 
		{
			if (a[i] - a[i - 1] <= k)
			{
				temp++;
			}
			else
			{
				temp = 1;
			}
			ans = max(ans, temp);
		}
		cout << n - ans << '\n';
	}
	return 0;
}
相关推荐
电科_银尘5 分钟前
【大模型算法与工程 14】Tokenizer与Embedding:文本如何变成模型输入
算法·embedding
饮水桶_T1 小时前
Python 面向对象(十七)|继承、封装、多态 笔记
数据结构·笔记·算法
地平线开发者4 小时前
让 AI Agent 和 征程6 台架高效、稳定、安全地协作
算法·安全·自动驾驶
kyle~5 小时前
SHA-256 哈希去重
算法·哈希算法
风落青芜8 小时前
链式二叉树的实现与基本操作
c语言·开发语言·数据结构·算法
青少儿编程课堂9 小时前
蓝桥杯·全国青少年信息素养大赛·电子学会Python/C++考级:中国剩余定理解析
c++·python·算法·bfs·信息学竞赛
wo_jack9 小时前
C++ 入门笔记(十八):list 进阶 —— const 迭代器、operator-> 与 clear 的坑
数据结构·c++·面试·stl·list
罗西的思考1 天前
【轻量化复刻大模型 / KIMI K3】Muon 优化器及 训练系统
人工智能·算法·机器学习
ashiho1 天前
【LeetCode hot 100】3. 无重复字符的最长子串 (三种解法)
java·数据结构·后端·算法·leetcode·滑动窗口
数据工匠老o1 天前
数据库没死,业务卡住了:行锁等待、元数据锁、长事务的排查路径
数据库·算法·架构