codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1065C.md (1667B)


      1 Source: https://codeforces.com/problemset/problem/1065/C
      2 
      3 C. Make It Equal
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 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 $h_i$ cubes, so it has height $h_i$.
     22 
     23 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.
     24 
     25 Let's name slice as good one if its cost is lower or equal to $k$ ($k \ge n$).
     26 
     27  ![](https://espresso.codeforces.com/3998ee05d80fc4a37cb2fdfa937a320fa39c5c3b.png) 
     28 
     29 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.
     30 
     31 Input
     32 
     33 The first line contains two integers $n$ and $k$ ($1 \le n \le 2 \cdot 10^5$, $n \le k \le 10^9$) — the number of towers and the restriction on slices, respectively.
     34 
     35 The second line contains $n$ space separated integers $h_1, h_2, \dots, h_n$ ($1 \le h_i \le 2 \cdot 10^5$) — the initial heights of towers.
     36 
     37 Output
     38 
     39 Print one integer — the minimum number of good slices you have to do to make all towers have the same heigth.
     40 
     41 Examples
     42 
     43 Input
     44 
     45 ```
     46 5 5  
     47 3 1 2 2 4
     48 ```
     49 
     50 Output
     51 
     52 ```
     53 2
     54 ```
     55 
     56 Input
     57 
     58 ```
     59 4 5  
     60 2 3 4 5
     61 ```
     62 
     63 Output
     64 
     65 ```
     66 2
     67 ```
     68 
     69 Note
     70 
     71 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$).