← All problemsSign in

High Score (Easy Version)

CodeChefRating 1977Open on judge ↗

**This is the easy version of the problem. The only difference is that in the easy version, $N$ is guaranteed to be equal to $M$.** You are given two arrays $A$ and $B$, of lengths $N$ and $M$ respectively, each consisting of positive integers. **It is guaranteed that $N = M$**. Your score is initially $0$. You can perform the following operation any number of times, as long as both arrays $A

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

Sign in to chat with the tutor and save your progress.

Sign in to start