Python Quick and Easy
Starting with sorting the array and then\nremoving the smaller values upto len(nums)-k\nand then print the remaining values of nums\n\n\nclass Solution(object):
Starting with sorting the array and then\nremoving the smaller values upto len(nums)-k\nand then print the remaining values of nums\n\n```\nclass Solution(object):\n    def maxSubsequence(self, nums, k):\n        dup=sorted(nums)\n        for i in range(len(nums)-k): nums.remove(dup[i])\n        return nums\n```\n\nDo **Upvote** if you find it useful
['Sorting', 'Python']