Solution: Maximum Running Time of N Computers
Understand how to apply a modified binary search technique to maximize the simultaneous running time of n computers powered by a given set of batteries. Explore feasibility checks to efficiently narrow down the runtime and grasp the practical approach to solving resource allocation problems.
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...