Update rearranging_fruits.py

Author: Drag0nop

greedy_methods/rearranging_fruits.py

@@ -1,26 +1,28 @@
 from collections import defaultdict
+from typing import DefaultDict, List
 
 
-def min_cost(basket1: list[int], basket2: list[int]) -> int:
+def min_cost(basket1: List[int], basket2: List[int]) -> int:
     n = len(basket1)
-    freq = defaultdict(int)
-    mn = float("inf")
+    freq: DefaultDict[int, int] = defaultdict(int)
+    mn: float = float("inf")
 
     for i in range(n):
         freq[basket1[i]] += 1
         freq[basket2[i]] -= 1
         mn = min(mn, basket1[i], basket2[i])
 
-    to_swap = []
+    to_swap: List[int] = []
     for j, k in freq.items():
         if k % 2 != 0:
             return -1
         to_swap += [j] * (abs(k) // 2)
 
     to_swap.sort()
-    res = 0
+    res: int = 0
     for i in range(len(to_swap) // 2):
-        res += min(to_swap[i], 2 * mn)
+        # Ensure mn is treated as int during arithmetic
+        res += min(to_swap[i], 2 * int(mn))
 
     return res
 
@@ -31,7 +33,7 @@ def min_cost(basket1: list[int], basket2: list[int]) -> int:
         ([4, 2, 2, 2], [1, 4, 1, 2]),  # Expected: 1
         ([1, 2, 3, 4], [2, 3, 4, 1]),  # Expected: 0
         ([1, 1, 1, 1], [1, 1, 1, 1]),  # Expected: 0
-        ([1, 2, 2], [2, 1, 1]),  # Expected: -1
+        ([1, 2, 2], [2, 1, 1]),        # Expected: -1
         ([5, 3, 3, 2], [2, 5, 5, 3]),  # Expected: -1
     ]