Question: solve fast please Problem Description Given an array A of N elements representing the monsters and an array B of Q elements representing the heros


![the heros strength less than B[i][1]. For each i you have to](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f4fd5f41e1d_67866f4fd5ea3c08.jpg)
solve fast please
Problem Description Given an array A of N elements representing the monsters and an array B of Q elements representing the heros strength less than B[i][1]. For each i you have to determine the number of monsters left after the i-th hero has completed their task Problem Constraints 1
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
