Koko Eating Bananas

def min_eating_speed(piles,h):
    import math
    l,r=1,max(piles)
    while l<r:
        mid=(l+r)//2
        hours=sum(math.ceil(p/mid) for p in piles)
        if hours<=h: r=mid
        else: l=mid+1
    return l

public int minEatingSpeed(int[] piles,int h){
    int l=1,r=0;
    for(int p:piles) r=Math.max(r,p);
    while(l<r){
        int mid=(l+r)/2;
        int hours=0;
        for(int p:piles) hours+=(p+mid-1)/mid;
        if(hours<=h) r=mid;
        else l=mid+1;
    } return l;
}