The problem was in a long story format but let me simplify it for you :-)

Problem: Some genie has power P. He wants to grant n wishes of the form {xi, yi}. Now to grant i-th wish he needs to have at least power xi and after granting this wish his power becomes P-yi. In this process, his power shouldn't dip below zero. What is the maximum no. of possible wishes he can grant using his power?

Constraints: 1<=n<=100, 1<=P<=30000, 1<=x<=30000, -300<=y<=300

I couldn't solve this problem in test time, I've seen so many problems of this type but I always fail. I would be grateful if someone explains this. Thanks have a good day!

Hello codeforces!

This post can be off topic for some of you so don't look down( On the screen ). And sorrrrrrrrrry ofcourse.

Can someone provide good notes and preparation resources for OOPS, OS and DBMS. Everyone having resources pls post in the comments many people will get benifitted by this small ( sarcastically small ) contribution of yours. Thank you very much.

Grow Together

UPD0: Downvote me hard from all your alts but provide what I asked for.

UPD1: I hate downvoter newbies because they are frustrated with their ratings.

Hello coders!

Problem link:

https://imgur.com/a/HESKUZK

Can someone please share the approach to solve this problem? Thanks so much!