Python 100% Faster Solution
\nclass Solution:\n    def maxSubsequence(self, nums: List[int], k: int) -> List[int]:\n        \n        sortEd = sorted(enumerate(nums), key = lambda x : x[1]
```\nclass Solution:\n    def maxSubsequence(self, nums: List[int], k: int) -> List[int]:\n        \n        sortEd = sorted(enumerate(nums), key = lambda x : x[1])[-k:]\n        \n        return [i[1] for i in sorted(sortEd, key = lambda x : x[0])]\n            \n```\n![image](https://assets.leetcode.com/users/images/7e56c7b7-79b8-47ab-9eda-a9697cd0f8ec_1639389038.1865692.png)\n
['Python']