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
ajay_5097:
20170529 11:27:56
Don't even dare to use "unsigned int" to save memory. Use long long Otherwise you'll get unsigned int overflow which will cause you WA. ;(


code_aim:
20170526 20:50:29
AC in one go!! 

rishi_07:
20170318 09:59:28
AC without Binary Search Last edit: 20170319 10:40:14 

ayush_1997:
20170314 20:54:47
use long long int :) 

Bozidar:
20170304 17:11:13
Pay attention to the most important part of the problem. Costed me several WA:


cake_is_a_lie:
20170304 02:19:05
You can solve it in O(N) with a special kind of "binary search". You can also solve it in O(N) with a sort and a linear search, but this won't be as effective.


sonudoo:
20170129 19:31:06
Same logic. Accepted in C++. TLE in Python 

vengatesh15:
20161107 18:52:57
AC in one go :)


dwij28:
20161014 12:01:57
Using begin as a global variable gives a compilation error in C++ 14 but not on g++ 4.9.2 (ubuntu). Got a compilation error for that. :/ P.s: This is binary search101. 

Shivam Gupta:
20161012 17:45:07
long long int please :) 
Added by:  ghorvat 
Date:  20120702 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  COCI 2011/2012 