Python Solution
```python3 []
class Solution:
    def minimumPairRemoval(self, nums: List[int]) -> int:
        count = 0
        while not all(nums[i] <= nums[i + 1] for i in range(len(nums) - 1)):
            min_v = math.inf
            for i in range(len(nums) - 1):
                v = nums[i] + nums[i + 1]
                if v < min_v:
                    min_v = v
                    index = i
            else:
                nums = nums[:index] + [min_v] + nums[index + 2:]
            count += 1
        return count
```
['Python3']