Could someone please suggest a method to solve this problem
Problem Description
You are playing a video game. Your character has two properties Power and Speed. Initially, your character has 1 power and 1 speed. Given N tasks in the game which need to be performed in any order. However, the ith task requires a minimum of A[i] power or B[i] speed. On completing the ith task you get C[i] points which you can use to increase power and speed. 1 point can be redeemed to increase 1 power or 1 speed. Find the maximum number of tasks that you can complete.
Problem Constraints
1<=N<=100 1<=A[i],B[i],C[1]<=1000 Input Format: The first argument is an integer array A. The second argument is an integer array B. The third argument is an integer array C. Return an integer that is the maximum number of tasks that you can complete.
Example Input Input 1:-
A=[1,1,2,7] B=[1,3,4,4] C=[2,3,1,1] Input 2:=
A=[1,2,4,9] B=[1,2,4,9] C=[2,1,2,3] Example Explanation Explanation 1:- Initially Power =1, speed =1 Perform task 1(1,1) required Points gained =2 New Power =1, speed =3 Perform task 2(1,3) Points gained =3 New Power =3, speed =4 Perform task 3(2,4) Points gained =1 New power =4, speed =4 Perform task (7,4) A11 tasks performed. values as specified
Problem source?
Its an OA Question i found on the internet.