Find Subsequence of Length K With the Largest Sum

export function maxSubsequence(nums: number[], k: number): number[] {
  return Array.from({ length: nums.length })
    .map((_, i) => i)
    .sort((a, b) => nums[b] - nums[a])
    .slice(0, k)
    .sort((a, b) => a - b)
    .map((i) => nums[i]);
}