Limited Shopping
There are $N$ shops in the town, numbered from $1$ to $N$. The $i$-th shop has an infinite amount of items with value $V_i$ each. And each item in each shop costs exactly $1$ dollar. To prevent you from spending all your money buying just the items of maximum value, you have to follow some rules: 1. Let $num_i$ be the number of items you bought at the $i$-th store. 2. $num_1$ can only be eithe
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.
Sign in to chat with the tutor and save your progress.
Sign in to start