Simple Python solution
Code

# Code
```python3 []
class Solution:
    def minimumPairRemoval(self, nums: List[int]) -> int:
        if nums == sorted(nums): return 0
        c=0
        while nums != sorted(nums):
            lst = min([(i, j, idx) for idx, (i, j) in enumerate(zip(nums, nums[1:]))], key=lambda p: p[0] + p[1])
            idx = lst[-1]
            nums = nums[:idx] + [lst[0] + lst[1]] + nums[idx + 2 :]
            c += 1
        return c
        
```
['Python3']