Given an array locks representing lock difficulties and an integer speed, find the minimum time to break all locks. Breaking a lock takes locks[i] / speed seconds.

You can break locks in parallel (multiple workers). The time is determined by the slowest lock divided among workers.