每日一题第四十六期 Codeforces Round 886 (Div. 4)

最新推荐文章于 2024-10-10 23:46:47 发布

娇娇yyyyyy

最新推荐文章于 2024-10-10 23:46:47 发布

阅读量1k

点赞数 23

分类专栏：每日一题 cf 文章标签：算法 c++ 图论

本文链接：https://blog.csdn.net/2301_80882026/article/details/137126049

版权

每日一题同时被 2 个专栏收录

97 篇文章 1 订阅

订阅专栏

30 篇文章 0 订阅

订阅专栏

探讨了如何在编程竞赛中，通过最少删除问题以保证题目的难度分布满足连续题目间最大难度差不超过k的要求，提供了代码实现示例。

摘要由CSDN通过智能技术生成

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 $a_i$ . 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$ ( $\leq t \leq 1000$ ) — the number of test cases.

The first line of each test case contains two positive integers $n$ ( $\leq n \leq 2 \cdot 10^5$ ) and $k$ ( $\leq k \leq 10^9$ ) — 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 $a_i$ ( $\leq a_i \leq 10^9$ ) — the difficulty of each problem.

Note that the sum of $n$ over all test cases doesn’t exceed $\cdot 10^5$ .

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
inputCopy
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
outputCopy
2
0
5
0
3
1
4

Note

For the first test case, we can remove the first $2$ problems and construct a set using problems with the difficulties $[4, 5, 6]$ , with difficulties between adjacent problems equal to $\leq 1$ and $\leq 1$ .

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

AC代码：

#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<queue>
#include<string>
#include<bitset>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<numeric>
//#define endl '\n'
using namespace std;

typedef long long ll;
typedef pair<int, int>PII;
const int N=3e5+10;
const int MOD=998244353;
const int INF=0X3F3F3F3F;
const int dx[]={-1,1,0,0,-1,-1,+1,+1};
const int dy[]={0,0,-1,1,-1,+1,-1,+1};
const int M = 1e8 + 10;

int t;
int a[N];
int main()
{
	cin >> t;
	while(t --){
		int n, k;
		cin >> n >> k;
		for(int i = 1; i <= n; i ++)
		{
			cin >> a[i];
		}
		int ans = 0, maxs = 0;
		sort(a + 1, a + 1 + n);
		for(int i = 1; i <= n; i ++)
		{
			if(a[i] - a[i - 1] > k) ans = 1;
			else ans ++;
            maxs = max(maxs, ans);
		}
		cout << n - maxs << endl;
	}
	return 0;
}