Find Subsequence of Length K With the Largest Sum LeetCode solution in JavaScript

1
var maxSubsequence = function (nums, k) {
2
  return nums
3
    .map((v, i) => [v, i])
4
    .sort((a, b) => a[0] - b[0])
5
    .slice(-k)
6
    .sort((a, b) => a[1] - b[1])
7
    .map((x) => x[0]);
8
};