Thieves and Diamonds

CodeChefOpen on judge ↗

Kenbo failed 5th grade for the 7th time. Dissappointed by him, his father told him to leave school and find a job. Being a naughty kid, Kenbo decided to become a thief. He decides to rob a diamond shop. The diamond shop contains $n$ diamonds and each diamond $i$ contains a shininess index $a_i$. Kenbo does not want to get caught and decides to leave the diamonds with the maximum shininess index.

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