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

Choose at most k distinct elements from nums such that their sum is maximized.

Return an array containing the selected elements sorted in strictly descending order.

Constraints:

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

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

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

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.