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題目，沒辦法要保證輸出的數(shù)組順序跟原來的順序是一樣的就只能優(yōu)先隊(duì)列去排序，list刪除優(yōu)先隊(duì)列刪除的元素，最后去輸出數(shù)組，

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.