New update is available. Click here to update.

Solve problems & track your progress

Checkout your overall progress in every topic here

Become

Sensei

in DSA topics

Open the topic and solve more problems associated with it to improve your skills

Check out the skill meter for every topic

See how many problems you are left with to solve for cracking any stage. Score more than zero to get your progress counted.

Problem

Submissions

SICK NINJA

Contributed by

Abhishek Gupta

Hard

0/120

Avg time to solve 40 mins

Success Rate 40 %

0 upvotes

Problem Statement

Ninja is having some health issues. So he decided to buy fruits to get nutrition. There are ‘N’ number of fruits. Each fruit has some amount of nutrition and a specific cost.

Ninja has ‘M’ units of money. You need to find the maximum amount of nutrition Ninja can get and the total cost to get maximum nutrition. The ninja can buy any number of fruits, but he can spend only at most ‘M’ units of money.

Note: If there are multiple values of costs possible for maximum nutrition, you need to find the minimum one.

Example:

Suppose there are 3 fruits with costs 1, 2, 3 and nutrition  2, 2, 3 units respectively. Ninja has 3 units of money. Then, the ninja can take fruits with costs 1 and 2, having the maximum nutritional value of  4 units for a cost of 3 units.

Detailed explanation ( Input/output format, Notes, Constraints, Images )

Input Format :

The first line contains ‘T,’ denoting the number of test cases.

The first line of each test case contains two space-separated integers, ‘M’ and ‘N’, denoting the amount of money ninja has and the total number of fruits.

The next ‘N’ line contains two space-separated integers, ‘X’ and ‘Y’, denoting each fruit's cost and nutrition value.

Output Format :

Print two space-separated integers the maximum amount of nutrition Ninja can get and the total cost to get maximum nutrition.

Note :

You don't need to print anything. It has already been taken care of. Just implement the given function.

Constraints :

1  <= N <= 1000
1 < = M <=1000
0 < = X <= 1000
0 < = Y <= 1000

Time Limit: 1 sec

Sample Input 1 :

Sample Output 1 :

12 8
 0 0

Explanation of sample input 1 :

For the first test case:-
The ninja can select the fruits at indices ( 0 - based ) 0, 1, and 3, which constitutes 12 units of nutrition and 8 units of cost.

For the second test case:-
The Ninja can not buy any of these fruits so he will have his nutrition as 0 and cost also 0 as well

Sample Input 2 :

Sample Output 2:

26 49
32 48

Auto

Console