Minimum Amount of Damage Dealt to Bob
You are given an integer power and two integer arrays damage and health, both having length n.
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
Example 2
Input: power = 1, damage = [1,1,1,1], health = [1,2,3,4]
Output: 20
Example 3
Input: power = 8, damage = [40], health = [59]
Output: 320
Constraints
- 1 <= power <= 10^4
- 1 <= n == damage.length == health.length <= 10^5
- 1 <= damage[i], health[i] <= 10^4
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.