Clear the Array

You are given an array $A$ of $N$ elements. You can do the following operations on that array: - Remove the leftmost element of the array, with index $l$, for the cost $A_l$. This can be done any number of times if the array is non-empty (has at least $1$ element). - Remove the rightmost element of the array, with index $r$, for the cost $A_r$. This can be done any number of times if the array is