You are given an integer array nums and an integer k.

In a single operation, you can choose any element in nums and increment its value by $1$.

Return the total number of contiguous subarrays of nums that can be made non decreasing by performing at most k operations.

Note: A subarray is non decreasing if each element is greater than or equal to the element immediately before it.

Constraints:

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

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

• $1 \leq$ k $\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.