Simple Solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\n/**\n * @param {number[]} nums\n * @param {number} k\n * @return {number[]}\n */\nvar maxSubsequence = function(nums, k) {\n    let arr=[...nums]\n    arr.sort((a,b)=>b-a)\n    arr=arr.slice(0,k)\n\n    let subar=[] \n   \n    for(let i=0;i<nums.length && arr.length >0;i++){\n        let index=arr.lastIndexOf(nums[i])\n        \n        if(index>=0){\n            subar.push(nums[i])\n            arr.splice(index,1)\n        }\n    }\n    return subar\n};\n```
['JavaScript']