Greedy coin change

A parking kiosk hands change back out of the hopper it has on hand. coin_cents[i] is what one coin of kind i is worth in cents, always at least one cent, and hopper_counts[i] is how many of that kind the hopper holds. The values are distinct and they arrive in no particular order. The kiosk pays greedily: it repeatedly takes the largest coin it still holds that is worth no more than the amount still owed, hands it over, and carries on until nothing is owed. It never takes a coin back, so it can stall on an amount that some other mix of coins would have covered. amount_cents is never negative. Return how many of each kind it paid, in the order coin_cents gives them. Return an empty list when the kiosk stalls with money still owed. Owing nothing is not a stall, so it pays a zero of every kind.