Tallest Pencil

CodeChefOpen on judge ↗

Chef was walking in his garden on a Sunday morning. He had $N$ number of pencils with him. The pencils are of varying heights. Accidentally he dropped all of his pencils in a pothole. He tried picking up the pencils but because he has short hands he can only pick up the tallest of the pencils. Help chef find out how many of his pencils will he be able to pick up ? ###Input: - The first line of

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