Problem 3801 · Hard

Minimum Cost to Merge Sorted Lists

Every merge history is a binary split of the lists, so a subset dynamic program finds the cheapest merge order.

Open the interactive visualisation