Update minimum-cost-for-cutting-cake-ii.cpp

Author: kamyu104

C++/minimum-cost-for-cutting-cake-ii.cpp

@@ -20,3 +20,23 @@ class Solution {
         return result;
     }
 };
+
+// Time:  O(mlogm + nlogn)
+// Space: O(1)
+// sort, greedy
+class Solution2 {
+public:
+    long long minimumCost(int m, int n, vector<int>& horizontalCut, vector<int>& verticalCut) {
+        sort(begin(horizontalCut), end(horizontalCut), greater<int>());
+        sort(begin(verticalCut), end(verticalCut), greater<int>());
+        int64_t result = 0;
+        for (int i = 0, j = 0; i < size(horizontalCut) || j < size(verticalCut); ) {
+            if (j == size(verticalCut) || (i < size(horizontalCut) && horizontalCut[i] > verticalCut[j])) {
+                result += horizontalCut[i++] * (j + 1);
+            } else {
+                result += verticalCut[j++] * (i + 1);
+            }
+        }
+        return result;
+    }
+};