Leetcode 3510. Minimum Pair Removal to Sort Array II

Given an array, repeatedly merge the leftmost adjacent pair with the minimum sum by replacing it with their sum; compute the minimum number of such merges required to make the array non-decreasing. With n up to 1e5 and large element values, the challenge is to reason about merge order and segment behavior efficiently rather than brute-force simulation.