<p>You are given two arrays <code>nums1</code> and <code>nums2</code> consisting of positive integers.</p>

<p>You have to replace <strong>all</strong> the <code>0</code>&#39;s in both arrays with <strong>strictly</strong> positive integers such that the sum of elements of both arrays becomes <strong>equal</strong>.</p>

<p>Return <em>the <strong>minimum</strong> equal sum you can obtain, or </em><code>-1</code><em> if it is impossible</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums1 = [3,2,0,1,0], nums2 = [6,5,0]
<strong>Output:</strong> 12
<strong>Explanation:</strong> We can replace 0&#39;s in the following way:
- Replace the two 0&#39;s in nums1 with the values 2 and 4. The resulting array is nums1 = [3,2,2,1,4].
- Replace the 0 in nums2 with the value 1. The resulting array is nums2 = [6,5,1].
Both arrays have an equal sum of 12. It can be shown that it is the minimum sum we can obtain.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums1 = [2,0,2,0], nums2 = [1,4]
<strong>Output:</strong> -1
<strong>Explanation:</strong> It is impossible to make the sum of both arrays equal.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums1.length, nums2.length &lt;= 10<sup>5</sup></code></li>
	<li><code>0 &lt;= nums1[i], nums2[i] &lt;= 10<sup>6</sup></code></li>
</ul>

class Solution:
    def minSum(self, nums1: List[int], nums2: List[int]) -> int:
        sum1 = sum(nums1)
        sum2 = sum(nums2)

        def count_zeros(arr):
            return len(list(filter(lambda x: x == 0, arr)))
        
        zeros1 = count_zeros(nums1)
        zeros2 = count_zeros(nums2)

        # the minimum sum is 
        # min_sum = min(sum1, sum2)
        if sum1 == sum2:
            if (zeros1 ==0 and zeros2 != 0) or (zeros1 != 0 and zeros2 == 0):
                return -1
            return sum1 + max(zeros1, zeros2)
        if sum1 < sum2:
            if zeros1 == 0:
                return -1
            diff = sum2 - sum1

            if zeros1 > diff and zeros2 == 0:
                return -1
            new_addition = max(diff + zeros2, zeros1)
            return sum1 + new_addition
        else:
            if zeros2 == 0:
                return -1
            diff = sum1 - sum2
            if zeros2 > diff and zeros1 == 0:
                return -1

            new_addition = max(diff + zeros1, zeros2)
            return sum2 + new_addition

        # Let's focus on the differences
        # sum1 = 6; zeros1 = 1
        # sum2 = 11; zeros2 = 2
        # general Goal: sum1 + x1 + x2 + ... = 11 + y1 + y2 + ...
        # concrete example
        # 6 + x1 = 11 + y1 + y2
        # x1 = 5 + y1 + y2
        # x1 -5 = y1 + y2 -> x1 > 5
        # x1 = 6
        # New simpler Solution:
        # min_sum = 
        
867