diff --git a/src/problem/mod.rs b/src/problem/mod.rs
index b83fb6e..0636831 100644
--- a/src/problem/mod.rs
+++ b/src/problem/mod.rs
@@ -390,3 +390,5 @@ mod p1387_sort_integers_by_the_power_value;
 mod p855_exam_room;
 
 mod p1705_maximum_number_of_eaten_apples;
+
+mod p3218_minimum_cost_for_cutting_cake_i;
diff --git a/src/problem/p3218_minimum_cost_for_cutting_cake_i.rs b/src/problem/p3218_minimum_cost_for_cutting_cake_i.rs
new file mode 100644
index 0000000..775c1c7
--- /dev/null
+++ b/src/problem/p3218_minimum_cost_for_cutting_cake_i.rs
@@ -0,0 +1,47 @@
+/**
+ * [3218] Minimum Cost for Cutting Cake I
+ */
+pub struct Solution {}
+
+// submission codes start here
+
+impl Solution {
+    pub fn minimum_cost(
+        m: i32,
+        n: i32,
+        mut horizontal_cut: Vec<i32>,
+        mut vertical_cut: Vec<i32>,
+    ) -> i32 {
+        let (m, n) = (m as usize, n as usize);
+        horizontal_cut.sort_unstable();
+        vertical_cut.sort_unstable();
+
+        let mut result = 0;
+        let (mut i, mut j) = (0, 0);
+
+        for _ in 0..m + n - 2 {
+            if j == n - 1 || i < m - 1 && horizontal_cut[i] < vertical_cut[j] {
+                result += horizontal_cut[i] * (n - j) as i32;
+                i += 1;
+            } else {
+                result += vertical_cut[j] * (m - i) as i32;
+                j += 1;
+            }
+        }
+
+        result
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_3218() {
+        assert_eq!(13, Solution::minimum_cost(3, 2, vec![1, 3], vec![5]));
+        assert_eq!(15, Solution::minimum_cost(2, 2, vec![7], vec![4]));
+    }
+}