chore: update

Author: yanglbme

solution/2000-2099/2099.Find Subsequence of Length K With the Largest Sum/README.md

@@ -109,28 +109,6 @@ class Solution {
 }
 ```
 
-#### C++
-
-```cpp
-class Solution {
-public:
-    vector<int> maxSubsequence(vector<int>& nums, int k) {
-        int n = nums.size();
-        vector<int> idx(n);
-        for (int i = 0; i < n; ++i) {
-            idx[i] = i;
-        }
-        sort(idx.begin(), idx.end(), [&](int i, int j) { return nums[i] < nums[j]; });
-        sort(idx.begin() + (n - k), idx.end());
-        vector<int> ans(k);
-        for (int i = n - k; i < n; ++i) {
-            ans[i - (n - k)] = nums[idx[i]];
-        }
-        return ans;
-    }
-};
-```
-
 #### Go
 
 ```go

solution/2000-2099/2099.Find Subsequence of Length K With the Largest Sum/README_EN.md

@@ -110,28 +110,6 @@ class Solution {
 }
 ```
 
-#### C++
-
-```cpp
-class Solution {
-public:
-    vector<int> maxSubsequence(vector<int>& nums, int k) {
-        int n = nums.size();
-        vector<int> idx(n);
-        for (int i = 0; i < n; ++i) {
-            idx[i] = i;
-        }
-        sort(idx.begin(), idx.end(), [&](int i, int j) { return nums[i] < nums[j]; });
-        sort(idx.begin() + (n - k), idx.end());
-        vector<int> ans(k);
-        for (int i = n - k; i < n; ++i) {
-            ans[i - (n - k)] = nums[idx[i]];
-        }
-        return ans;
-    }
-};
-```
-
 #### Go
 
 ```go