3510. Minimum Pair Removal to Sort Array II

Like version I, but n is large. Per operation, find the adjacent pair with the minimum sum (leftmost on ties), merge into one sum element. Find the minimum operations to make the array…