Maximize the Oranges

CodeChefOpen on judge ↗

There are two rows of boxes. The color of the boxes of one rows is red while the color of the boxes of the other row is blue. Both the rows have N boxes indexed from 1 to N and contains some oranges in it. Let us denote the number of orange in the ith box of the red color be R[i]. Similarly the number of orange in the ith box of the blue color be B[i]. Jackson wants to select some boxes in such

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