Koko has `piles` of bananas and `h` hours before the guards return. Each hour she picks a pile and eats up to her speed k bananas from it (if the pile has fewer, she finishes it and stops for that hour). Return the minimum integer speed k that lets her eat all bananas within h hours.