Find Minimum Cost to Remove Array Elements

Given an array where at each step you may remove any two elements from the first three (or if <3 remain, remove all) with cost equal to the maximum of removed elements, compute the minimum total cost to clear the array. The core challenge is choosing which pair among the first three to remove at each step (a small local decision space) — solvable by dynamic programming over prefixes to minimize total max-cost.