cf1065 C Make It Equal

题目：http://codeforces.com/problemset/problem/1065/C

There is a toy building consisting of nn towers. Each tower consists of several cubes standing on each other. The ii-th tower consists of hihicubes, so it has height hihi.

Let's define operation slice on some height HH as following: for each tower ii, if its height is greater than HH, then remove some top cubes to make tower's height equal to HH. Cost of one "slice" equals to the total number of removed cubes from all towers.

Let's name slice as good one if its cost is lower or equal to kk (k≥nk≥n).

Calculate the minimum number of good slices you have to do to make all towers have the same height. Of course, it is always possible to make it so.

Input

The first line contains two integers nn and kk (1≤n≤2⋅1051≤n≤2⋅105, n≤k≤109n≤k≤109) — the number of towers and the restriction on slices, respectively.

The second line contains nn space separated integers h1,h2,…,hnh1,h2,…,hn (1≤hi≤2⋅1051≤hi≤2⋅105) — the initial heights of towers.

Output

Print one integer — the minimum number of good slices you have to do to make all towers have the same heigth.

Examples

input

Copy

5 5
3 1 2 2 4

output

Copy

2

input

Copy

4 5
2 3 4 5

output

Copy

2

这题模拟起来好烦，我从最高层依次往下找，直到k个方块，细心一点，有的细节还是挺坑的。

code：

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 5;
ll h[N];

int main()
{
	int n;
	int k;
	scanf("%d%d", &n, &k);
	for (int i = 0; i < n; i++)
	{
		cin >> h[i];
	}
	sort(h, h + n);
	ll mn = h[0];
	for (int i = 0; i < n; i++)
	{
		h[i] -= mn;
	}
	ll cnt = 0;
	ll hei = h[n - 1];
	ll ret = 0ll;
	int id = n;
	while (hei > 0 && id > 0)
	{
		ll sum = n - id;
		int idd = id - 1;
		hei--;
		while (idd >= 0 && h[idd] > hei)
		{
			sum++;
			idd--;
		}
		idd++;
		//cout << sum << endl;
		if (sum + ret <= k)
		{
			ret += sum;
			id = idd;
		}
		else
		{
			cnt++;
			ret = sum;
			id = idd;
		}

	}
	if (ret > 0)
		cnt++;
	cout << cnt << endl;
	return 0;
}