You are given an integer array nums of length n and an integer k.

The value of a subarray is defined as the difference between the maximum element and the minimum element in that subarray.

You need to select k subarrays from nums. You are allowed to choose the same subarray multiple times.

Return the maximum possible total sum of the values of the chosen k subarrays.

Constraints:

• $1 \leq n ==$ nums.length $\leq 5 \times 10^{4}$

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

• $1 \leq$ k $\leq 10^5$

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.