Given an integer array nums with an even number of elements, divide it into n pairs so that each element belongs to exactly one pair. For each pair, take the smaller value, and return the largest possible sum of these smaller values.

Note: n is half the length of nums.

Constraints:

• $1 \leq$ n $\leq 10^4$

• nums.length $= 2 \cdot n$

• $-10^4 \leq$ nums[i] $\leq 10^4$

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.