Find Subsequence of Length K with the Largest Sum

Statement

You are given an integer array nums and an integer k. Your task is to find a subsequenceA subsequence is an array derived from another array by deleting some or no elements while preserving the order of the remaining elements. of nums of length k that has the largest possible sum.

Constraints:

• $1 \leq$ nums.length $\leq 1000$

• $-10^5 \leq$ nums[i] $\leq 10^5$

• $1 \leq$ k $\leq$ nums.length

Examples