EKO  Eko
Lumberjack Mirko needs to chop down M metres of wood. It is an easy job for him since he has a nifty new woodcutting machine that can take down forests like wildfire. However, Mirko is only allowed to cut a single row of trees.
Mirko‟s machine works as follows: Mirko sets a height parameter H (in metres), and the machine raises a giant sawblade to that height and cuts off all tree parts higher than H (of course, trees not higher than H meters remain intact). Mirko then takes the parts that were cut off. For example, if the tree row contains trees with heights of 20, 15, 10, and 17 metres, and Mirko raises his sawblade to 15 metres, the remaining tree heights after cutting will be 15, 15, 10, and 15 metres, respectively, while Mirko will take 5 metres off the first tree and 2 metres off the fourth tree (7 metres of wood in total).
Mirko is ecologically minded, so he doesn‟t want to cut off more wood than necessary. That‟s why he wants to set his sawblade as high as possible. Help Mirko find the maximum integer height of the sawblade that still allows him to cut off at least M metres of wood.
Input
The first line of input contains two spaceseparated positive integers, N (the number of trees, 1 ≤ N ≤ 1 000 000) and M (Mirko‟s required wood amount, 1 ≤ M ≤ 2 000 000 000).
The second line of input contains N spaceseparated positive integers less than 1 000 000 000, the heights of each tree (in metres). The sum of all heights will exceed M, thus Mirko will always be able to obtain the required amount of wood.
Output
The first and only line of output must contain the required height setting.
Example
Input: 4 7 20 15 10 17 Output: 15
Input: 5 20 4 42 40 26 46 Output: 36
hide comments
shubh_ank207:
20210720 20:52:58
a big heart to binary search . its lubbb Last edit: 20210720 20:53:12 

yaduvans_hi:
20210715 08:15:24
Same logic as Minimum pages book problem. 

likhita_avl123:
20210709 16:34:34
can someone provide java solution? I tried printwriter, fastreader and also using long. 

imran_2018:
20210701 05:00:09
Same concept as aggressive cows and painters partition problem. Very good question on binary search 

akshat047:
20210630 15:14:17
Hi all im using accumulate to get the sum of the array and it is giving wrong ans LOL! 

sinhadipti:
20210625 12:34:37
similar like Book allocation and Aggressive cows.


sagar_rohi:
20210615 15:57:25
For java solution use the fastReader and printWrite for printing . otherwise the solution is going to stuck on test case no.9 :) 

hisoka_morow:
20210612 09:23:33
AC in one go!!


akshayani_09:
20210523 15:40:38
I was held up at test case 9...just remember that the exact M metres of wood might not be available ..so you need to take the next possible one...;)


shvm_83:
20210521 12:28:56
Why using of pragmas

Added by:  ghorvat 
Date:  20120702 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  COCI 2011/2012 