C. Stable Groups

time limit per test

1 second

memory limit per test

256 megabytes

There are n students numerated from 1 to n. The level of the i-th student is ai. You need to split the students into stable groups. A group of students is called stable, if in the sorted array of their levels no two neighboring elements differ by more than x.

For example, if x=4, then the group with levels 1,10,8,4,4 is stable (because 4−1≤x, 4−4≤x, 8−4≤x, 10−8≤x), while the group with levels 2,10,10,7 is not stable (7−2=5>x).

Apart from the n given students, teachers can invite at most k additional students with arbitrary levels (at teachers' choice). Find the minimum number of stable groups teachers can form from all students (including the newly invited).

For example, if there are two students with levels 1 and 5; x=2; and k≥1, then you can invite a new student with level 3 and put all the students in one stable group.

Input

The first line contains three integers n, k, x (1≤n≤200000, 0≤k≤1018, 1≤x≤1018) --- the initial number of students, the number of students you can additionally invite, and the maximum allowed level difference.

The second line contains n integers a1,a2,...,an (1≤ai≤1018) --- the students levels.

Output

In the only line print a single integer: the minimum number of stable groups you can split the students into.

Examples

Input

Copy

复制代码
8 2 3
1 1 5 8 12 13 20 22

Output

Copy

复制代码
2

Input

Copy

复制代码
13 0 37
20 20 80 70 70 70 420 5 1 5 1 60 90

Output

Copy

复制代码
3

Note

In the first example you can invite two students with levels 2 and 11. Then you can split the students into two stable groups:

  1. 1,1,2,5,8,11,12,13,
  2. 20,22.

In the second example you are not allowed to invite new students, so you need 3 groups:

  1. 1,1,5,5,20,20

  2. 60,70,70,70,80,90

  3. 420

解题说明:此题是一道模拟题,采用贪心算法,首先对数列进行排序,然后针对差值再进行排序。将填充的k个值与不满足条件的差值进行判断,首先填充到最开始不满足条件的差值位置中。否则只能将数列拆分。

cpp 复制代码
#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
using namespace std;
int main() 
{
	long long a[200001], b[200001], cnt, n, x, k;
	cin >> n >> k >> x;
	for (int i = 1; i <= n; i++) 
	{
		cin >> a[i];
	}
	sort(a + 1, a + n + 1);
	for (int i = 2; i <= n; i++)
	{
		b[i - 1] = a[i] - a[i - 1];
	}
	sort(b + 1, b + n);
	for (int i = 1; i < n; i++)
	{
		if (b[i] > x)
		{
			if (k >= (b[i] - 1) / x)
			{
				k -= (b[i] - 1) / x;
			}
			else
			{
				cnt++;
			}
		}
	}
	cout << ++cnt;
	return 0;
}
相关推荐
吃我一窝jio6 小时前
Python与Go线程模型深度对比
java·开发语言·python
eggwyw7 小时前
C++ union 的一种妙用法
开发语言·c++
starzy19909 小时前
深入理解Scala隐式函数:自动类型转换
开发语言·后端·scala
布莱克60511 小时前
Swift 循环与控制转移详解:从 for-in 到标签跳转
开发语言·ssh·swift·循环
敲上瘾11 小时前
Qt核心机制:信号与槽详解
开发语言·c++·qt·ui·qt6.3
老花眼猫12 小时前
C语言绘图方法:(10)椭圆缩放旋转
c语言·经验分享·青少年编程·课程设计
联犀12 小时前
ai时代复杂项目的golang项目如何更好的与ai共舞:monorepo+gozero
开发语言·人工智能·golang
lcj251114 小时前
[C++] C++11
开发语言·c++·笔记
Evand J15 小时前
【MATLAB例程】基于IMM-CKF的AOA+测距融合的二维移动目标跟踪定位
开发语言·matlab·目标跟踪
JianZhen✓17 小时前
IM 聊天列表为什么总“消息乱跳“:有序插入、时间轴派生、本地截断、已读回执
开发语言·前端·php