Expensive Trip to Cafe

CodeChefOpen on judge ↗

One day 4ul \_sharma and abhist were bunking class and chilling in the cafe. On seeing them chilling, goyalanubhav11 gave them an interesting problem to solve. He gave them N integers and an integer K and asked them to find the largest number >= K if it exists, else print -1. 4ul \_sharma and abhist found this problem too easy for them so goyalanubhav11 decided to make it tougher. He then gave th

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