The Job

CodeChefOpen on judge ↗

Apple is offering a job to new Students . Each Day Apple selects only $1$ $Student$ out of $N$ $Students$. Today is the day of the interview. $N$ students are standing in a queue waiting for their interview. The selection process of apple got leaked. The Selection Criterion is : The Student with $Maximum$ $f(x)$ will be Selected . In-Case of a Tie The Student with $Minimum$ $Index$ will be chosen

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