feat: add cpp solution to lc problem: No.1337 (doocs#776)

No.1337.The K Weakest Rows in a Matrix

Co-authored-by: Yang Libin <contact@yanglibin.info>

Author: Dhoni77

solution/1300-1399/1337.The K Weakest Rows in a Matrix/README.md

@@ -156,10 +156,42 @@ function kWeakestRows(mat: number[][], k: number): number[] {
 }
 ```
 
-### **...**
-
-```
+### **C++**
 
+```cpp
+class Solution {
+public:
+    int search(vector<int>& m)
+    {
+        int l = 0;
+        int h = m.size() - 1;
+        while (l <= h)
+        {
+            int mid = l + (h - l) / 2;
+            if (m[mid] == 0)
+                h = mid - 1;
+            else
+                l = mid + 1;
+        }
+        return l;
+    }
+    
+    vector<int> kWeakestRows(vector<vector<int>>& mat, int k) {
+        vector<pair<int, int>> p;
+        vector<int> res;
+        for (int i = 0; i < mat.size(); i++)
+        {
+            int count = search(mat[i]);
+            p.push_back({count, i});
+        }
+        sort(p.begin(), p.end());
+        for (int i = 0; i < k; i++)
+        {
+            res.push_back(p[i].second);
+        }
+        return res;
+    }
+};
 ```
 
 <!-- tabs:end -->

solution/1300-1399/1337.The K Weakest Rows in a Matrix/README_EN.md

@@ -149,10 +149,42 @@ function kWeakestRows(mat: number[][], k: number): number[] {
 }
 ```
 
-### **...**
-
-```
+### **C++**
 
+```cpp
+class Solution {
+public:
+    int search(vector<int>& m)
+    {
+        int l = 0;
+        int h = m.size() - 1;
+        while (l <= h)
+        {
+            int mid = l + (h - l) / 2;
+            if (m[mid] == 0)
+                h = mid - 1;
+            else
+                l = mid + 1;
+        }
+        return l;
+    }
+    
+    vector<int> kWeakestRows(vector<vector<int>>& mat, int k) {
+        vector<pair<int, int>> p;
+        vector<int> res;
+        for (int i = 0; i < mat.size(); i++)
+        {
+            int count = search(mat[i]);
+            p.push_back({count, i});
+        }
+        sort(p.begin(), p.end());
+        for (int i = 0; i < k; i++)
+        {
+            res.push_back(p[i].second);
+        }
+        return res;
+    }
+};
 ```
 
 <!-- tabs:end -->

solution/1300-1399/1337.The K Weakest Rows in a Matrix/Solution.cpp

@@ -0,0 +1,33 @@
+class Solution {
+public:
+    int search(vector<int>& m)
+    {
+        int l = 0;
+        int h = m.size() - 1;
+        while (l <= h)
+        {
+            int mid = l + (h - l) / 2;
+            if (m[mid] == 0)
+                h = mid - 1;
+            else
+                l = mid + 1;
+        }
+        return l;
+    }
+    
+    vector<int> kWeakestRows(vector<vector<int>>& mat, int k) {
+        vector<pair<int, int>> p;
+        vector<int> res;
+        for (int i = 0; i < mat.size(); i++)
+        {
+            int count = search(mat[i]);
+            p.push_back({count, i});
+        }
+        sort(p.begin(), p.end());
+        for (int i = 0; i < k; i++)
+        {
+            res.push_back(p[i].second);
+        }
+        return res;
+    }
+};