In a card game, your opponent places n monster cards onto the board, the i th of which has hi health points. You in turn have m ≥ n hero cards in your hand, the j th of which deals dj damage per turn. To begin the game, you will choose n heroes from your hand and assign each of them to a different enemy monster. Each turn, your heroes will deal damage equal to their damage power to the opposing enemy. If at any point an opponent’s monster reaches 0 health or less, then it is destroyed. You are given a limited number of turns k to destroy all enemy monsters.
Control structures
Control structures are block of statements that analyze the value of variables and determine the flow of execution based on those values. When a program is running, the CPU executes the code line by line. After sometime, the program reaches the point where it has to make a decision on whether it has to go to another part of the code or repeat execution of certain part of the code. These results affect the flow of the program's code and these are called control structures.
Switch Statement
The switch statement is a key feature that is used by the programmers a lot in the world of programming and coding, as well as in information technology in general. The switch statement is a selection control mechanism that allows the variable value to change the order of the individual statements in the software execution via search.
In a card game, your opponent places n monster cards onto the board, the i th of which has hi health points.
You in turn have m ≥ n hero cards in your hand, the j th of which deals dj damage per turn.
To begin the game, you will choose n heroes from your hand and assign each of them to a different enemy monster.
Each turn, your heroes will deal damage equal to their damage power to the opposing enemy.
If at any point an opponent’s monster reaches 0 health or less, then it is destroyed.
You are given a limited number of turns k to destroy all enemy monsters.
Design an
First develop a Θ(m log m) time algorithm, then improve it to Θ(m + n log n)
Do not write the code, give steps and methods. Explain the steps of algorithm, and the logic behind these steps in plain English
input is The number of monsters n, the health points hi of each monster, the number of heroes m, the damage power dj of each hero, and the number of turns k.
Each of the n chosen heroes is paired with exactly one monster. Each of the n chosen heroes is paired with a different monster.There is no rearrangement after the initial allocation of heroes to monsters.
Each of the n chosen heroes fights their allocated monster, dealing dj points of damage per turn. If all n monsters are destroyed in k turns or fewer, the player wins. Otherwise, the player loses. the monsters don't deal damage to the heroes. hero should be assigned to the monster with the most health points
Step by step
Solved in 2 steps
