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

Given an integer array nums and k, pick k elements (keeping their relative order) whose sum is maximized and return any such subsequence. The challenge is to choose the k largest-valued elements while preserving original ordering (n ≤ 1000).