3684. Maximize Sum of At Most K Distinct Elements

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

Choose at most k elements from nums so that their sum is maximized. However, the chosen numbers must be distinct.

Return an array containing the chosen numbers in strictly descending order.

class Solution {
public:
    vector<int> maxKDistinct(vector<int>& nums, int k) {
        sort(begin(nums), end(nums));
        nums.erase(unique(begin(nums), end(nums)), end(nums));
        reverse(begin(nums), end(nums));
        while(nums.size() > k) nums.pop_back();
        return nums;
    }
};