Get Minimum Cost

Problem Overview

• Find the minimum total cost to remove all elements by repeatedly taking any two of the first three items; each operation costs the max of the two, and when fewer than three remain, remove all at the cost of their maximum.
• Input: int array arr[n]; Output: int minimum cost; Constraints: 1 ≤ n ≤ 10^3 and 1 ≤ arr[i] ≤ 10^6.
• Domain: models cost-aware batching on a queue where only the front segment is eligible.
• This Deshaw interviews problem is a common coding interview interview question.