Connect Ropes

Given an array of integers A representing the length of ropes.

You need to connect these ropes into one rope. The cost of connecting two ropes is equal to the sum of their lengths.

Find and return the minimum cost to connect these ropes into one rope.

1 <= length of the array <= 100000
1 <= A[i] <= 1000

The only argument given is the integer array A.

Return an integer denoting the minimum cost to connect these ropes into one rope.

Input 1:

 A = [1, 2, 3, 4, 5]

Input 2:

 A = [5, 17, 100, 11]

Output 1:

 33

Output 2:

 182

Explanation 1:

 Given array A = [1, 2, 3, 4, 5].
 Connect the ropes in the following manner:
 1 + 2 = 3
 3 + 3 = 6
 4 + 5 = 9
 6 + 9 = 15


So, total cost  to connect the ropes into one is 3 + 6 + 9 + 15 = 33.

Explanation 2:

 Given array A = [5, 17, 100, 11].
 Connect the ropes in the following manner:
 5 + 11 = 16
 16 + 17 = 33
 33 + 100 = 133


So, total cost  to connect the ropes into one is 16 + 33 + 133 = 182.