1. Koko loves to eat bananas. 2. There are N piles of bananas, the i-th pile has piles[i] bananas. The guards have gone and will come back in H hours. 3. 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 won't eat any more bananas during this hour. 4. Koko likes to eat slowly, but still wants to finish eating all the bananas before the guards come back. 5. Return the minimum integer K such that she can eat all the bananas within H hours.
Input Format
First line contains N. second line contains n space separated integers. Third line contains H.
Output Format
Return the integer.
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