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
yashwanth_58:
20160928 16:26:22
Use printf and scanf


aditya1997:
20160827 19:39:54
good problem on binary search :)


Anuj Arora:
20160819 23:03:48
no need of binary_search........sort and linear search......AC in one go Last edit: 20160819 23:04:50 

pt97:
20160724 18:54:34
easy one


NAVENDU AYUSH:
20160703 00:18:36
%I64d > tle , %lld >AC 

mkfeuhrer:
20160702 10:34:24
can someone tell about 0.01sec logic!! AC in 0.5 with i/o optimizations.. 

pvsmpraveen:
20160629 22:16:15
I got AC ...


mahmood_2000:
20160623 07:53:25
use scanf printf that cost me 1 TLE 2 WA 

aitya:
20160620 15:08:03
One should refer to the Topcoder article on binary search if you can't think of an approach. 

visvats_141095:
20160616 19:34:16
my 50th ! :) 
Added by:  ghorvat 
Date:  20120702 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  COCI 2011/2012 