Ridiculous answer. TC: average: O(n^2). SC: O(1)
This is for entertainment purposes only and should not be used as an answer in the real world\n\n\n\tvector<int> maxSubsequence(vector<int>& nums, int k) {\n\t\
**This is for entertainment purposes only and should not be used as an answer in the real world**\n\n```\n\tvector<int> maxSubsequence(vector<int>& nums, int k) {\n\t\tif (k == 1) return {*max_element(nums.begin(), nums.end())};\n\t\t\n\t\twhile (nums.size() > k)\n\t\t\tnums.erase(min_element(nums.begin(), nums.end())); \n\n\t\treturn nums;\n\t}\n```
['C']