Max Window

CodeChefOpen on judge ↗

You are given the marks of $n$ students in their exam, where $a_i$ denotes the marks obtained by $i$-th student. The teacher feels that the class did not do very well in the exam, so she has a list of benchmarking criterions $b$, which is a list of $m$ integers sorted in descending order, to assess their work. The students wish to prove to the teacher that they did very well in the test. To

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