142ms | beats 100% | simple solution with explanation
Intuition\nKeep a copy of original array. Then sort original array and take first nums.Length-k numbers. Remove them one by one from the copy array of original 
# Intuition\nKeep a copy of original array. Then sort original array and take first nums.Length-k numbers. Remove them one by one from the copy array of original array. Then we get the result. \n\n![image.png](https://assets.leetcode.com/users/images/6362b11c-703e-4f2a-9ec3-386e91ef0bdd_1675105714.419523.png)\n\n\n# Code\n```\npublic class Solution {\n    public int[] MaxSubsequence(int[] nums, int k) {\n        int len = nums.Length, index = 0;\n        //to keep the order of original array\n        var copy = new int[len];\n        Array.Copy(nums,copy,len);\n        Array.Sort(nums);\n        var excludes = nums[0..(len-k)].ToList();\n        var res = new int[k];\n        foreach(var c in copy){\n            if(excludes.Contains(c)){\n                excludes.Remove(c);\n            }\n            else{\n                res[index++] = c;                \n            }\n        }\n        return res;\n    }\n}\n```
['C#']