6 line || using hashing || c++ soln
\nclass Solution {\npublic:\n    \n    vector<int> maxSubsequence(vector<int>& nums, int k) {\n        \n        vector<int> v , temp = nums;\n        sort(nums
```\nclass Solution {\npublic:\n    \n    vector<int> maxSubsequence(vector<int>& nums, int k) {\n        \n        vector<int> v , temp = nums;\n        sort(nums.begin() , nums.end());\n        unordered_map<int,int> map;\n        \n        for(int index = 0 ; index < k ; index ++) map[nums[nums.size() - 1- index]]++; \n        for(auto it: temp) if(map[it]-- > 0)v.push_back(it);\n    return v;\n    }\n};\n\n```
['C']