Please do and explain this in Java:

Coco is a hard-working student working part-time at a retail store. Coco's job is to replenish canned food on the shelf. The canned foods are boxed and piled up in the storage. Assume there're n piles of canned food, each pile has piles [n] boxes, Coco can decide the boxes-per-hour stocking speed of k. When Coco begins to work, each hour, Coco chooses a pile and re-stock k boxes from that pile. If the pile has less than boxes, Coco can stock all of the boxes and Coco can rest until the next hour begins(Helpful method to consider when implementing the logics here otherwise Coco will finish it up with additional hours. The manager will leave the store once Coco begins to work, and Coco needs to stock up all the canned food on the shelf before the manager comes back in h hours. Determine the minimum integer k speed such that Coco can finish replenishing up all the boxes within h hours. Examples Explanation: When minimum speed k=4, Coco need 1 hour for the first pile 2 hours for the second pile 2 hours for the third pile 3 hours for the fourth pile Total cost of hours =1+2+2+3=8, which is