<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:
        left1 = 0
        left2 = 0
        sum1 = sum(nums1)
        sum2 = sum(nums2)
        diff = (sum1 - sum2)
        bit = 0
        ans=0
        if diff> 0:
            # print("first case")
            nums2.sort()
            nums1.sort(reverse= True)
            while (left1 < len(nums1) or left2<len(nums2)) and diff>0:
                if nums1[left1]-1 > 6-nums2[left2] or bit == 1:
                    # print("left1", left1)
                    diff -= nums1[left1]-1
                    # print("diff1", diff)
                    if left1 == len(nums1)-1 and diff >0:
                        return -1
                    left1+=1
                    ans+=1

                else:
                    # if 6 - nums2[left2] == 0:
                    # print("left2", left2)
                    diff -= 6 - nums2[left2]
                    if left2 < len(nums2)-1:
                        left2+=1
                        ans+=1
                    # print("diff2", diff)
                    if left2 == len(nums2)-1:
                        bit = 1
                        ans+=1

        diff = (sum1 - sum2)
        
        if diff< 0:
            # print("second case")

            # temp = nums2
            # nums2 = nums1
            # nums1 = temp
            nums2.sort(reverse=True)
            nums1.sort()
            diff = -diff
            while (left1 < len(nums1) or left2<len(nums2)) and diff>0:
                if nums2[left2]-1 > 6-nums1[left1] or bit == 1:
                    # print("left2", left2)
                    diff -= nums2[left2]-1
                    # print("diff2", diff)
                    if left2 == len(nums2)-1 and diff >=0:
                        diff -= nums2[left2]-1
                        if diff>0:
                            return -1
                        # print(diff)
                        # print(ans)
                        # return -1
                    left2+=1
                    ans+=1

                else:
                    # if 6 - nums2[left2] == 0:
                    # print("left1", left1)
                    diff -= 6 - nums1[left1]
                    if left1 < len(nums1)-1:
                        left1+=1
                        ans+=1
                    # print("diff1", diff)
                    if left1 == len(nums1)-1:
                        bit = 1
                        ans+=1
                    # if bit == 1:
                    #     # print(len(nums1), len(nums2))
                    #     # print(ans)
        return ans
                    
975