add 3218

Author: fishercoder1534

Diff for: paginated_contents/algorithms/4th_thousand/README.md

@@ -1,5 +1,6 @@
 | #    | Title                                                                                                                                                               | Solutions                                                                                                                         | Video                                                                         | Difficulty | Tag                                                                  
 |------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|------------|----------------------------------------------------------------------
+| 3218 | [Minimum Cost for Cutting Cake I](https://leetcode.com/problems/minimum-cost-for-cutting-cake-i/)                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3218.java) |                                                                               | Medium     | 
 | 3217 | [Delete Nodes From Linked List Present in Array](https://leetcode.com/problems/delete-nodes-from-linked-list-present-in-array/)                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3217.java) |                                                                               | Medium     | LinkedList 
 | 3216 | [Lexicographically Smallest String After a Swap](https://leetcode.com/problems/lexicographically-smallest-string-after-a-swap/)                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3216.java) |                                                                               | Easy       | Greedy
 | 3212 | [Count Submatrices With Equal Frequency of X and Y](https://leetcode.com/problems/count-submatrices-with-equal-frequency-of-x-and-y/)                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3212.java) |                                                                               | Medium     | Prefix Sum

Diff for: src/main/java/com/fishercoder/solutions/fourththousand/_3218.java

@@ -0,0 +1,44 @@
+package com.fishercoder.solutions.fourththousand;
+
+import java.util.PriorityQueue;
+
+public class _3218 {
+    public static class Solution1 {
+        public int minimumCost(int m, int n, int[] horizontalCut, int[] verticalCut) {
+            PriorityQueue<Integer> maxHeapHorizontal = new PriorityQueue<>((a, b) -> b - a);
+            for (int cut : horizontalCut) {
+                maxHeapHorizontal.offer(cut);
+            }
+            PriorityQueue<Integer> maxHeapVertical = new PriorityQueue<>((a, b) -> b - a);
+            for (int cut : verticalCut) {
+                maxHeapVertical.offer(cut);
+            }
+            int verticalParts = 1;
+            int horizontalParts = 1;
+            int cost = 0;
+            while (!maxHeapHorizontal.isEmpty() || !maxHeapVertical.isEmpty()) {
+                Integer curr;
+                if (!maxHeapHorizontal.isEmpty() && !maxHeapVertical.isEmpty()) {
+                    if (maxHeapHorizontal.peek() > maxHeapVertical.peek()) {
+                        curr = maxHeapHorizontal.poll();
+                        cost += curr * verticalParts;
+                        horizontalParts++;
+                    } else {
+                        curr = maxHeapVertical.poll();
+                        cost += curr * horizontalParts;
+                        verticalParts++;
+                    }
+                } else if (!maxHeapHorizontal.isEmpty()) {
+                    curr = maxHeapHorizontal.poll();
+                    cost += curr * verticalParts;
+                    horizontalParts++;
+                } else {
+                    curr = maxHeapVertical.poll();
+                    cost += curr * horizontalParts;
+                    verticalParts++;
+                }
+            }
+            return cost;
+        }
+    }
+}