LeetCode 2099. Find Subsequence of Length K With the Largest Sum

You are given an integer array nums and an integer k. You want to find a subsequence of nums of length k that has the largest sum.

Return any such subsequence as an integer array of length k.

A subsequence is an array that can be derived from another array by deleting some or no elements without changing the order of the remaining elements.

Example 1:

Input: nums = [2,1,3,3], k = 2Output: [3,3]Explanation:The subsequence has the largest sum of 3 + 3 = 6.

Example 2:

Input: nums = [-1,-2,3,4], k = 3Output: [-1,3,4]Explanation: The subsequence has the largest sum of -1 + 3 + 4 = 6.

Example 3:

Input: nums = [3,4,3,3], k = 2Output: [3,4]Explanation:The subsequence has the largest sum of 3 + 4 = 7. Another possible subsequence is [4, 3].

Constraints:

• 1 <= nums.length <= 1000

• -105 <= nums[i] <= 105

• 1 <= k <= nums.length

• Easy题目，没办法要保证输出的数组顺序跟原来的顺序是一样的就只能优先队列去排序，list删除优先队列删除的元素，最后去输出数组，

Runtime: 11 ms, faster than 39.79% of Java online submissions for Find Subsequence of Length K With the Largest Sum.

Memory Usage: 42.8 MB, less than 15.79% of Java online submissions for Find Subsequence of Length K With the Largest Sum.