Sponsored
Sponsored
Use these hints if you're stuck. Try solving on your own first.
Iterate on days <code>1</code> to <code>m * n</code>.
On each day, buy the product that minimizes <code>values[i][values[i].length - 1]</code>, and pop it from <code>values[i]</code>.