3684. Maximize Sum of At Most K Distinct Elements

LeetCodeArrayHash TableGreedySortingOpen on judge ↗

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. Example 1: Input: nums = [84,93,100,77,90], k = 3 Output: [100,93,90] Explanation: The maximum sum is 283, which is attained by choosing 93

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI