Lets Sort It!

CodeChefOpen on judge ↗

We all love Cheems and Cheems loves cheemsburger and arrays, but Cheems is having a problem with arrays, so you want to help him to solve the problem. You are given an interger $X$ and an array of $N$ integers, You can perform the following operation: - Choose any index and swap the value of array with $X$ iff $a[i] > X$ Your goal is to find minimum number of operations you will require

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