1. Koko loves to eat bananas. There are n piles of bananas, the ith pile has piles[i] bananas. The guards have gone and will come back in h hours. 2. Koko can decide her bananas-per-hour eating speed of k. Each hour, she chooses some pile of bananas and eats k bananas from that pile. If the pile has less than k bananas, she eats all of them instead and will not eat any more bananas during this hour. 3. Koko likes to eat slowly but still wants to finish eating all the bananas before the guards return. 4. Return the minimum integer k such that she can eat all the bananas within h hours.
Input Format
Input is managed for you
Output Format
Output is managed for you
Constraints
1 <= piles.length <= 10^4 piles.length <= h <= 10^9 1 <= piles[i] <= 10^9
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
4 3 6 7 11 8
Output
4