Python3 solution
Code


# Code
```python3 []
class Solution:
    def minimumPairRemoval(self, nums: List[int]) -> int:
        count = 0

        while not self.is_array_increasing(nums):
            index = self.get_min_pair(nums)
            s = nums[index] + nums[index + 1]
            count = count + 1
            nums[index] = s
            nums.pop(index + 1)
        
        return count
    
    def get_min_pair(self, nums):
        smallest = 99999
        index = -1

        for i in range(len(nums) - 1):
            s = nums[i] + nums[i + 1]

            if s < smallest:
                index = i
                smallest = s
        
        return index
    
    def is_array_increasing(self, nums):
        for i in range(len(nums) - 1):
            if nums[i] > nums[i + 1]:
                return False
        return True
```
['Python3']