<p>You are given two arrays of integers <code>nums1</code> and <code><font face="monospace">nums2</font></code>, possibly of different lengths. The values in the arrays are between <code>1</code> and <code>6</code>, inclusive.</p>

<p>In one operation, you can change any integer&#39;s value in <strong>any </strong>of the arrays to <strong>any</strong> value between <code>1</code> and <code>6</code>, inclusive.</p>

<p>Return <em>the minimum number of operations required to make the sum of values in </em><code>nums1</code><em> equal to the sum of values in </em><code>nums2</code><em>.</em> Return <code>-1</code>​​​​​ if it is not possible to make the sum of the two arrays equal.</p>

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

<pre>
<strong>Input:</strong> nums1 = [1,2,3,4,5,6], nums2 = [1,1,2,2,2,2]
<strong>Output:</strong> 3
<strong>Explanation:</strong> You can make the sums of nums1 and nums2 equal with 3 operations. All indices are 0-indexed.
- Change nums2[0] to 6. nums1 = [1,2,3,4,5,6], nums2 = [<u><strong>6</strong></u>,1,2,2,2,2].
- Change nums1[5] to 1. nums1 = [1,2,3,4,5,<strong><u>1</u></strong>], nums2 = [6,1,2,2,2,2].
- Change nums1[2] to 2. nums1 = [1,2,<strong><u>2</u></strong>,4,5,1], nums2 = [6,1,2,2,2,2].
</pre>

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

<pre>
<strong>Input:</strong> nums1 = [1,1,1,1,1,1,1], nums2 = [6]
<strong>Output:</strong> -1
<strong>Explanation:</strong> There is no way to decrease the sum of nums1 or to increase the sum of nums2 to make them equal.
</pre>

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

<pre>
<strong>Input:</strong> nums1 = [6,6], nums2 = [1]
<strong>Output:</strong> 3
<strong>Explanation:</strong> You can make the sums of nums1 and nums2 equal with 3 operations. All indices are 0-indexed. 
- Change nums1[0] to 2. nums1 = [<strong><u>2</u></strong>,6], nums2 = [1].
- Change nums1[1] to 2. nums1 = [2,<strong><u>2</u></strong>], nums2 = [1].
- Change nums2[0] to 4. nums1 = [2,2], nums2 = [<strong><u>4</u></strong>].
</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>1 &lt;= nums1[i], nums2[i] &lt;= 6</code></li>
</ul>

class Solution:
    def minOperations(self, nums1: List[int], nums2: List[int]) -> int:
        min1 = len(nums1)
        min2 = len(nums2)
        max1 = 6*min1
        max2 = 6*min2
        if min1 > max2 or min2 > max1:
            return -1
        
        ops = 0
        sum1 = sum(nums1)
        sum2 = sum(nums2)
        diff = sum2 - sum1
        if diff == 0:
            return 0
        if diff < 0: # sum1 < sum2
            combined = [num-6 for num in nums2] + [1-num for num in nums1]
            diff = -diff
        else:
            combined = [num-6 for num in nums1] + [1-num for num in nums2]
        heapq.heapify(combined)
        while diff > 0 and combined:
            diff += heapq.heappop(combined)
            ops += 1
        return ops
        
        # nums1 = Counter(nums1)
        # nums2 = Counter(nums2)
        # while sum1 != sum2:
        #     diff = sum1 - sum2
        #     if diff > 0:
        #         # find max of sum1 and decrease it
        #         # find min of sum2 and increase it
        #         max1 = max(nums1)
        #         diff1 = min(max1 - 1, diff)
        #         min2 = min(nums2)
        #         diff2 = min(6 - min2, diff)
        #         if diff1 > diff2:
        #             nums1[max1] -= 1
        #             nums1[max1 - diff1] += 1
        #             sum1 -= diff1
        #         else:
        #             nums2[min2] -= 1
        #             nums2[min2 + diff2] += 1   
        #             sum2 += diff2
        #     else:
        #         diff = -diff
        #         max2 = max(nums2)
        #         diff2 = min(max2 - 1, diff)
        #         min1 = min(nums1)
        #         diff1 = min(6 - min1, diff)
        #         if diff1 > diff2:
        #             nums1[max1] -= 1
        #             nums1[max1 - diff1] += 1
        #             sum1 -= diff1
        #         else:
        #             nums2[min2] -= 1
        #             nums2[min2 + diff2] += 1  
        #             sum2 += diff2
        #     ops += 1
        # return ops

941