Koko Eating Bananas (Binary Search on Answer)

Koko loves to eat bananas. There are n piles of bananas, the i-th pile has piles[i] bananas. The guards will return in h hours.

Koko can decide her bananas-per-hour eating speed of k. Each hour, she chooses a pile and eats k bananas from that pile. If the pile has less than k bananas, she eats all of them and will not eat any more bananas during this hour.

Return the minimum integer k such that she can eat all the bananas within h hours.

Example 1

Input: piles = [3,6,7,11], h = 8
Output: 4

Constraints

• 1 <= piles.length <= 10^4
• piles.length <= h <= 10^9
• 1 <= piles[i] <= 10^9