Joining the Ropes
You repeatedly join two ropes into one; joining ropes of lengths x and y costs x + y. Print the minimum total cost to combine all ropes into a single rope.
Input: the first line has N; the second line has the N rope lengths.
Output: the minimum joining cost.
Constraints:
- 1 ≤ N ≤ 105
- 1 ≤ length ≤ 106
Sample Tests
Input 1
4 4 3 2 6
Output 1
29
Input 2
1 5
Output 2
0
Discussion (opens after you solve — no spoilers before)
No comments yet.