You are given an integer power and two integer arrays damage and health, both having length n.
Bob has n enemies, where enemy i will deal Bob damage[i] points of damage per second while they are alive (i.e. health[i] > 0).
Every second, after the enemies deal damage to Bob, he chooses one of the enemies that is still alive and deals power points of damage to them.
Determine the minimum total amount of damage points that will be dealt to Bob before all n enemies are dead.
Example 1:
Input: power = 4, damage = [1,2,3,4], health = [4,5,6,8]
Output: 39
Explanation:
10 + 10 = 20 points.6 + 6 = 12 points.3 points.2 + 2 = 4 points.Example 2:
Input: power = 1, damage = [1,1,1,1], health = [1,2,3,4]
Output: 20
Explanation:
4 points.3 + 3 = 6 points.2 + 2 + 2 = 6 points.1 + 1 + 1 + 1 = 4 points.Example 3:
Input: power = 8, damage = [40], health = [59]
Output: 320
Constraints:
1 <= power <= 1041 <= n == damage.length == health.length <= 1051 <= damage[i], health[i] <= 104Solutions for this problem are being prepared.
Try solving it yourselfJump Game II - Greedy - Leetcode 45 - Python • NeetCode • 238,353 views views
Watch 9 more video solutions →Practice Minimum Amount of Damage Dealt to Bob with our built-in code editor and test cases.
Practice on FleetCode