Easy C++ Solution
\n\tvector<int> maxSubsequence(vector<int>& nums, int k) \n    {        \n        vector<int> ans,temp(nums.begin(),nums.end());\n        \n        sort(temp.be
```\n\tvector<int> maxSubsequence(vector<int>& nums, int k) \n    {        \n        vector<int> ans,temp(nums.begin(),nums.end());\n        \n        sort(temp.begin(),temp.end(),greater<int>());\n\n        temp.resize(k);\n        \n        unordered_map<int,int> m;\n        \n        for(int &i:temp)\n        {\n            m[i]++;\n        }\n        \n        for(int &i:nums)\n        {\n            if(m[i]!=0)\n            {\n                ans.push_back(i);\n                m[i]--;\n            }\n        }\n    \n        return ans;\n    }\n```
['C']