Given n docks with open times openTimes (length n) and a list of delivery time costs (length 4n, since each dock handles exactly 4 deliveries), assign deliveries greedily so the latest finish time across all docks is minimized. Return that earliest possible completion time.