Koko Eating Bananas - Read Statement

Koko loves bananas. There are $n$ piles with piles[i] bananas. Guards return in $h$ hours. Koko eats at speed $k$ bananas per hour. Each hour she picks one pile and eats $k$ bananas. If the pile has fewer than $k$, she eats the whole pile and doesn't eat more that hour.

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