No More Stories

CodeChefOpen on judge ↗

You are given two arrays consisting of n integers (arr1,arr2). You need compute the value of given function f(i) for each i (1 <= i <= n) f(i) = max( g(i) , h(i) ) where, g(i) represents the $arr2[i]^{th}$ smallest element of the $i^{th}$ prefix array of arr1. h(i) represents the $arr2[i]^{th}$ smallest element of the $i^{th}$ suffix array of arr1. If $arr2[i]^{th}$ smallest element does not e

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