diff --git a/11_Binary-Search/Minimum Cost to Make Array Equal.py b/11_Binary-Search/Minimum Cost to Make Array Equal.py
new file mode 100644
index 00000000..0f43f2af
--- /dev/null
+++ b/11_Binary-Search/Minimum Cost to Make Array Equal.py	
@@ -0,0 +1,26 @@
+# https://leetcode.com/problems/minimum-cost-to-make-array-equal/
+
+class Solution:
+    def minCost(self, nums: List[int], cost: List[int]) -> int:
+        def cal_cost(target):
+            ans = 0
+            for n, c in zip(nums, cost):
+                ans += abs(target - n) * c
+            return ans
+        
+        low = min(nums); high = max(nums)
+        while low <= high:
+            mid = low + (high - low) // 2
+            cur_cost = cal_cost(mid)
+            right_cost = cal_cost(mid + 1)
+            
+            if cur_cost < right_cost:
+                high = mid - 1
+            else:
+                low = mid + 1
+        
+        return cal_cost(low)
+      
+
+# Time: O(N log(N))
+# Space: O(1)