← All problemsSign in

Weird Game

You were playing a game and now you have stumbled upon a bag .The bag contains $N$ potions.The $i^{th}$ [ $1 \leq i \leq N$ ] potion will increase your health by $a[i]$. But each time you pick a potion your health increases by $a[i]$ but the value of all the remaining potions decreases by one. Find any valid permutation by which the potions should be picked such that your final health is maximi

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

Sign in to chat with the tutor and save your progress.

Sign in to start