SHOPPING

CodeChefOpen on judge ↗

Shubham Raj likes shopping, and especially he likes to buy oranges. But right now he is short of money. He has only Rs $k$. There are n oranges. The i-th one costs Rs $j$ and has weight equal to $w$. Shubham wants to buy a set of oranges with the maximal possible weight. Please help him, and tell him this weight. ###Input: -The first line of the input contains an integer $T$ denoting the number

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI