Leetcode 1167. Minimum Cost to Connect Sticks

Given a list of stick lengths where merging any two sticks costs the sum of their lengths, compute the minimum total cost to combine all sticks into one. This is a greedy/Huffman-like problem: repeatedly choose the two smallest sticks (min-heap) to minimize accumulated merge cost.