You are given a $0$ indexed integer array nums and an integer k. You must perform the following operation exactly k times to maximize your total score:

$1$. Choose an element m from nums.
$2$. Remove the selected element m from nums.
$3$. Insert a new element with the value m $+ 1$ into nums.
$4$. Add m to your total score.

Your initial score is $0$. Return the maximum total score achievable after performing the operation exactly k times.

Constraints:

• $1 \leq$ nums.length $\leq 100$

• $1 \leq$ nums[i] $\leq 100$

• $1 \leq$ k $\leq 100$

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.