Maximize Sum of At Most K Distinct Elements

You are given an integer array nums containing positive integers and an integer k.
Your task is to select at most k distinct elements from nums such that their sum is maximized.
After selecting, return the chosen elements in strictly descending order.
If there are multiple possible sets with the same maximum sum, any valid set is acceptable.