Joining the Ropes — Solution & Editorial

Back to the Problem

Huffman-style greedy: always join the two shortest ropes (min-heap); their combined length re-enters the pool.

Complexity: O(N log N)

Watch out: Total cost reaches ~10⁶·log·N — 64-bit.