Make It Equal（贪心加前缀和）

Make It Equal

There is a toy building consisting of n towers. Each tower consists of several cubes standing on each other. The i-th tower consists of hi cubes, so it has height hi.

Let’s define operation slice on some height H as following: for each tower i, if its height is greater than H, then remove some top cubes to make tower’s height equal to H. 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 k (k≥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 n and k (1≤n≤2⋅105, n≤k≤109) — the number of towers and the restriction on slices, respectively.

The second line contains n space separated integers h1,h2,…,hn (1≤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
5 5
3 1 2 2 4
Output
2
Input
4 5
2 3 4 5
Output
2
Note
In the first example it’s optimal to make 2 slices. The first slice is on height 2 (its cost is 3), and the second one is on height 1 (its cost is 4).

---

题意：给一个长度为n的序列，要求把序列中所有大于等于H的数切为H，求一个最小的操作步数。

理解这个题之后恍然大悟，，来康康这个图（手工制作，不要嫌，），窝理解为每次横着切一次，一次最多切k块，问一个最小次数可以把这些柱切的一样高；
所以这就变成是很明显的一个前缀和的啦，记录每一层有多少块，然后宁就会懂啦，，