python solution faster 95%
\tclass Solution:\n\t\tdef maxSubsequence(self, nums: List[int], k: int) -> List[int]:\n\t\t\theap = []\n\t\t\tfor n in nums:\n\t\t\t\theapq.heappush(heap, n)\n
\tclass Solution:\n\t\tdef maxSubsequence(self, nums: List[int], k: int) -> List[int]:\n\t\t\theap = []\n\t\t\tfor n in nums:\n\t\t\t\theapq.heappush(heap, n)\n\t\t\t\tif len(heap) > k:\n\t\t\t\t\theapq.heappop(heap)\n\t\t\tcnt = Counter(heap)\n\t\t\tres = []\n\t\t\tfor n in nums:\n\t\t\t\tif cnt[n] > 0:\n\t\t\t\t\tcnt[n] -= 1\n\t\t\t\t\tres.append(n)\n\t\t\treturn res
[]