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 space-separated 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 space-separated 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
abhiaps: 2019-12-04 13:48:09

if your submission suddenly gives wrong answer after running(9) then you may try what i did
i converted int to long long int and mine was accepted.

father3301: 2019-12-02 16:58:40

if you are getting TLE .....simply use
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
inside main() function

shikhar_may7: 2019-10-20 15:30:57

In case of BS, use scanf printf for i/o else you'll get TLE

xom__b: 2019-10-04 21:08:02

Last edit: 2019-10-04 21:09:28
emtiaz_001: 2019-09-29 12:04:02

just follow the @payal2621 instruction . this cost me two wrong ans.

payal2621: 2019-08-15 19:04:43

Now you have to be careful over here
if you do not get a mid whose sum is equal to m then we should print the mid whose sum is next highest to m
Try this test case:
7 8
1 2 3 4 5 6 7
output:
3

Last edit: 2019-08-15 19:05:27
prudhvi_495: 2019-06-20 13:27:02

No bs needed. Use long int :)

kingho: 2019-06-03 18:18:31

Who can help me fast I/O in PHP, please? I can submit in Java, but can not with PHP.

dkkv0000: 2019-05-08 06:55:58

good problem on binary search

abhimanyu_1998: 2019-04-08 07:02:40

Cakewalk


Added by:ghorvat
Date:2012-07-02
Time limit:0.130s-0.261s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All
Resource:COCI 2011/2012