522. Minimum Eating Speed for All Piles

Given piles of items and H hours, each hour you pick one pile and consume up to speed items from it (if fewer remain you finish that pile and stop for the hour). Return the minimum integer speed that lets you finish every pile within H hours. Input: '[piles], H'.

Input: '[piles], H'.

Output: Integer — the minimum speed.

Examples

Input: [3,6,7,11], 8
Output: 4
Explanation: Speed 4 finishes within 8 hours.

Input: [30,11,23,4,20], 5
Output: 30
Explanation: Tight hour budget.

Input: [30,11,23,4,20], 6
Output: 23
Explanation: Looser budget allows a slower speed.

Constraints

• 1<=n<=10^4
• n<=H<=10^9
• 1<=pile<=10^9

Asked by