You are given an integer array nums of length n.

In one operation, you can select a contiguous subarray of nums and a positive integer x, then increase each element in the selected subarray by x.

Return the minimum possible sum of all chosen values of x required to make nums non decreasing.

Constraints:

• $1 \leq n ==$ nums.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.