HandsOn

$3$: Two Costs

Questions

$<$

$>$

You are given $2$ arrays A and B$,$ each of size N$.$

You are now standing at index N and want to move to index $1$ by performing the following operation one or more times until you reach index $1$:

$1.$ Let's say that the element you are currently standing on is i$.$ The cost of standing at index i will be equal to A$[$i$].$

$2.$ Choose index j such that $1$ s j