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 anoth

maxSubsequence.js

/**
 * @param {number[]} nums
 * @param {number} k
 * @return {number[]}
 */
var maxSubsequence = function(nums, k) {
    // Step 1: Map each element to a pair [value, originalIndex]
    const withIndices = nums.map((num, index) => [num, index]);

    // Step 2: Sort by value in descending order to find the top-k values
    withIndices.sort((a, b) => b[0] - a[0]);

    // Step 3: Take the top-k pairs
    const topK = withIndices.slice(0, k);

    // Step 4: Sort the selected pairs by original index to preserve subsequence order
    topK.sort((a, b) => a[1] - b[1]);

    // Step 5: Extract and return only the values
    return topK.map(pair => pair[0]);
};