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
jmr99:
20181015 18:45:57
nice question *__* BS.. amazed me again 

ameyanator:
20180927 08:15:00
Classical Binary Search.


aaakash_rai:
20180920 05:49:07
Use fast io accompanied by a sum array and binary search for index with the value of mid. 

shashankpathak:
20180912 11:30:06
Ac after many wrong submission . A silly mistake in binary search! Last edit: 20180912 12:04:06 

ihg_2_26:
20180909 08:56:56
ezy pzy 

nguyenfromvn:
20180812 18:27:25
AC in 1st submit, but my time excute is 0.59s, quiet bad for a solution but im still happy with my attempt. HAPPY CODING!!! 

mujahid_3732:
20180808 20:14:46
@shreya_jn,,you can use faster io for java


shreya_jn:
20180620 15:10:05
TLE in JAVA. PS dont waste time using java 

aakash2509:
20180517 11:21:13
Use scanf and printf..!!!!!!!! cin cout gives negative answers for large inputs and tle on submission..!!


anirudnits:
20180509 12:10:56
my 100th in spoj :) 
Added by:  ghorvat 
Date:  20120702 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  COCI 2011/2012 