The Mountaineer

CodeChefOpen on judge ↗

Saurabh loves to climb mountains, but he climbs the mountain only when the height of the mountains are in increasing order. Now he decided to climb the mountains, but it may be possible that the height of the mountains is not in increasing order. There are $N$ mountains, whose heights are $H[1], H[2], H[3], ... , H[N]$. But before climbing the mountains he has to arrange the height of mountains

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