chore: update

Author: yanglbme

solution/3300-3399/3367.Maximize Sum of Weights after Edge Removals/README.md

@@ -186,14 +186,14 @@ public:
                 }
             }
             ranges::sort(t, greater<>());
-            for (int i = 0; i < min((int) t.size(), k - 1); ++i) {
+            for (int i = 0; i < min((int)t.size(), k - 1); ++i) {
                 s += t[i];
             }
             return {s + (t.size() >= k ? t[k - 1] : 0), s};
         };
 
-        auto ans = dfs(dfs, 0, -1);
-        return max(ans.first, ans.second);
+        auto [x, y] = dfs(dfs, 0, -1);
+        return max(x, y);
     }
 };
 ```

solution/3300-3399/3367.Maximize Sum of Weights after Edge Removals/README_EN.md

@@ -183,14 +183,14 @@ public:
                 }
             }
             ranges::sort(t, greater<>());
-            for (int i = 0; i < min((int) t.size(), k - 1); ++i) {
+            for (int i = 0; i < min((int)t.size(), k - 1); ++i) {
                 s += t[i];
             }
             return {s + (t.size() >= k ? t[k - 1] : 0), s};
         };
 
-        auto ans = dfs(dfs, 0, -1);
-        return max(ans.first, ans.second);
+        auto [x, y] = dfs(dfs, 0, -1);
+        return max(x, y);
     }
 };
 ```

solution/3300-3399/3367.Maximize Sum of Weights after Edge Removals/Solution.cpp

@@ -24,13 +24,13 @@ class Solution {
                 }
             }
             ranges::sort(t, greater<>());
-            for (int i = 0; i < min((int) t.size(), k - 1); ++i) {
+            for (int i = 0; i < min((int)t.size(), k - 1); ++i) {
                 s += t[i];
             }
             return {s + (t.size() >= k ? t[k - 1] : 0), s};
         };
 
-        auto ans = dfs(dfs, 0, -1);
-        return max(ans.first, ans.second);
+        auto [x, y] = dfs(dfs, 0, -1);
+        return max(x, y);
     }
 };