Leetcode 3684. Maximize Sum of At Most K Distinct Elements

Select up to k distinct numbers from nums to maximize their sum — equivalently, pick the largest unique values. Return those chosen values sorted in strictly descending order (up to k unique top elements).