[Javascript] Easy Priority Queue Solution
```\nconst maxSubsequence = function (nums, k) {\n\tconst heap = new MinPriorityQueue({\n\t\tcompare: (el1, el2) => el1.number < el2.number,\n\t}), res = [];\n 
```\nconst maxSubsequence = function (nums, k) {\n\tconst heap = new MinPriorityQueue({\n\t\tcompare: (el1, el2) => el1.number < el2.number,\n\t}), res = [];\n    \n\tfor (let i = 0; i < nums.length; i++)\n\t\theap.enqueue({ number: nums[i], position: i });\n\t\n\twhile (k--)\n\t\tres.push(heap.dequeue());\n\n\treturn res.sort((a, b) => a.position - b.position).map(v => v.number);\n};
['Heap (Priority Queue)', 'JavaScript']