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
xom__b:
20191004 21:08:02
Last edit: 20191004 21:09:28 

emtiaz_001:
20190929 12:04:02
just follow the @payal2621 instruction . this cost me two wrong ans. 

payal2621:
20190815 19:04:43
Now you have to be careful over here


prudhvi_495:
20190620 13:27:02
No bs needed. Use long int :) 

kingho:
20190603 18:18:31
Who can help me fast I/O in PHP, please? I can submit in Java, but can not with PHP. 

dkkv0000:
20190508 06:55:58
good problem on binary search 

abhimanyu_1998:
20190408 07:02:40
Cakewalk


sajalagrawal14:
20190128 12:39:09
just use binary search !!!!


abhinav_99:
20190125 06:49:25
Simply observe the pattern no binary search required


rajat_123:
20181101 07:24:36
Use Fast IO in Java else you will get TLE :)

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