Christmas Celebration

CodeChefOpen on judge ↗

There are $N$ trees planted in Ankush's garden. The height of the i-th tree $(1 ≤ i ≤ N)$ is $Hi$ meters. But Ankush remains very busy so he decided to explain the problem to Aditya and let Aditya do the task for him. So the problem is described as: You are allowed to choose only $K$ trees from $N$ trees and decorate them with electric lights. To make the scenery more beautiful, Ankush tell Aditya

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