>>109961883
python3:
def minimumCosts(self, regular: list[int], express: list[int], expressCost: int) -> list[int]:
test cases:
# tc1
[1,6,9,5]
[5,2,3,10]
8
[1,7,16,21] (output)
# tc2
[11,5,13]
[7,10,6]
3
[10,15,24]
# tc3
[1,6,9,5]
[5,2,3,10]
99999
[1,7,16,21]
even if u don't have leetcode premium you should be able to make a solution from those test cases and the problem description