Solution: Maximum Running Time of N Computers
Understand how to apply a modified binary search to determine the maximum number of minutes n computers can run simultaneously using available batteries. Explore the problem constraints, the monotonic property that justifies binary search, and the step-by-step solution process to efficiently evaluate runtime feasibility.
We'll cover the following...
Statement
You are given an integer, n, representing the number of computers, and a 0-indexed integer array, batteries, where batteries[i] denotes the number of minutes the
Your goal is to run all n computers simultaneously for the maximum possible number of minutes using the available batteries.
Initially, you may assign at most one battery to each computer. After that, at any moment, you may remove a battery from a computer and replace it with another battery—either an unused battery or one taken from another computer. This replacement process can be repeated any number of times and takes no time.
Each battery can power any computer multiple times, but only until it is completely drained. Batteries cannot be recharged.
Return the maximum number of minutes you can run all n computers simultaneously.
Constraints:
1
n...