3010. Divide an Array Into Subarrays With Minimum Cost I

class Solution: def minimumCost(self, nums: List[int]) -> int: return nums.pop(0) + sum(sorted(nums)[:2])