Understandable solution with python
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\nFirst, list is copied and it sorted in ascending order.Second, list is sl
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\nFirst, list is copied and it sorted in ascending order.Second, list is sliced by getting biggest numbers in list and then rest of th list is loaded another list. Finally, numbers of th list is removed it .\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```\nclass Solution(object):\n    def maxSubsequence(self, nums, k):\n        new, nums_2 = [], list(nums)\n        nums_2.sort()\n        new = nums_2[:-k]\n        for z in new:\n            print(z)\n            nums.remove(z)\n        return nums\n\n\nobj = Solution()\nprint(obj.maxSubsequence([63, -74, 61, -17, -55, -59, -10, 2, -60, -65], 9))\n```
['Python']