init

23/07/2500.cpp

@@ -0,0 +1,22 @@
+#include <vector>
+#include <queue>
+using namespace std;
+
+class Solution {
+public:
+    int deleteGreatestValue(vector<vector<int>>& grid) {
+        int m = grid.size(), n = grid[0].size();
+        for (int i = 0; i < m; i++) {
+            sort(grid[i].begin(), grid[i].end());
+        }
+        int res = 0;
+        for (int j = 0; j < n; j++) {
+            int mx = 0;
+            for (int i = 0; i < m; i++) {
+                mx = max(mx, grid[i][j]);
+            }
+            res += mx;
+        }
+        return res;
+    }
+};