Easy to understand || brute force
\n\tclass Solution {\n\tpublic:\n\n\n\t\tvector maxSubsequence(vector& nums, int k) {\n\t\twhile(nums.size() != k){\n\t\t\tauto it= min_element(nums.begin(), nu
\n\tclass Solution {\n\tpublic:\n\n\n\t\tvector<int> maxSubsequence(vector<int>& nums, int k) {\n\t\twhile(nums.size() != k){\n\t\t\tauto it= min_element(nums.begin(), nums.end());\n\t\t\tnums.erase(it);\n\t\t}\n\t\treturn nums;\n\t\t}\n\n\t};
['C++']