Solution without heap [99% faster ]
\'\'\'\n\n    def maxSubsequence(self, nums: List[int], k: int) -> List[int]:\n        \n        a=[]\n        for i,char in enumerate(nums):\n            a.app
\'\'\'\n\n    def maxSubsequence(self, nums: List[int], k: int) -> List[int]:\n        \n        a=[]\n        for i,char in enumerate(nums):\n            a.append([char,i])               #putting values with indexes\n  \n        a.sort()                #sort and keep the last k beacuse they are the largest\n        a=a[-k:]\n        a.sort(key=lambda x:x[1])       #sort by indexing \n        l=[]\n        for i in a:                 \n            l.append(nums[i[1]])\n        return l\n\'\'\'
['C', 'Python']