C++ short and concise brute force solution 
Please, upvote if you like it. Thanks :-)Complexity

Time complexity:
O(n * n)


Space complexity:
O(n)

Code
Please, upvote if you like it. Thanks :-)

# Complexity
- Time complexity:
O(n * n)

- Space complexity:
O(n)

# Code
```cpp []
int minimumPairRemoval(vector<int>& nums) {
    int res = 0;
    while (!ranges::is_sorted(nums) && ++res) {
        int minSum = INT_MAX, startInd = -1;
        for (int j = 0; j + 1 < nums.size(); j++) {
            if (nums[j] + nums[j + 1] < minSum) {
                minSum = nums[j] + nums[j + 1];
                startInd = j;
            }
        }
        nums[startInd] += nums[startInd + 1];
        nums.erase(nums.begin() + startInd + 1);
    }
    return res;
}
```
['C++']