← All problemsSign in

Jaadu and Bournvita

Rohit wants to drink bournvita which is defined by an array of $N$ positive integers. But Rohit wants it to be magical.Magic Strength of bournvita is inversely proportional to the size of array. To make it magical Jaadu uses special magic called $dhuuuuuupp$. He can use atmost $K$ such moves ,where $K = 2$. In one move he can choose the $i^{th}$ element and remove all such elements $j$ such tha

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