Find Subsequence of length K with largest sum
\'\'\'\nclass Solution {\npublic:\n    vector maxSubsequence(vector& nums, int k) {\n        \n        int  p = nums.size() - k ;\n        \n        while(p)\n 
\'\'\'\nclass Solution {\npublic:\n    vector<int> maxSubsequence(vector<int>& nums, int k) {\n        \n        int  p = nums.size() - k ;\n        \n        while(p)\n        {\n          \n           nums.erase(min_element(nums.begin() , nums.end()));\n            p--;\n        }\n        \n       \n        return nums ;\n    }\n};\n\'\'\'
['C']