Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Joining the Ropes

Joining the Ropes

Difficulty: 1300 5000 ms 128 MB

greedy heap

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

Read the Editorial Statistics

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.
Ctrl+Enter submit · Ctrl+Space autocomplete · F11 fullscreen