Leetcode 3218. Minimum Cost for Cutting Cake I

Given costs for each horizontal and vertical cut on an m×n cake where each cut's cost is incurred once for every segment it crosses, determine the order of cuts that minimizes total cost — a greedy scheduling problem solvable by always performing the currently largest remaining cut while tracking how many segments it will affect.