You are given an array nums consisting of positive integers.

Starting with an initial score of $0$, process the array by repeatedly performing the following operations until all elements are marked:

$1$. Select the smallest unmarked integer in nums. If there is a tie, select the one with the smallest index.
$2$. Add the value of the chosen integer to your total score.
$3$. Mark the chosen element as well as its immediate left and right adjacent elements, if they exist.

Return the total score obtained after all elements in nums are marked.

Constraints:

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

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

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.