Challenge 2: Connecting n pipes with minimum cost

Problem Statement

Implement a function that, given n pipes of different lengths, connects these pipes into one pipe. The cost to connect two pipes is equal to the sum of their lengths. We need to connect the pipes with minimum cost.

Input

An array where its length is the number of pipes and indexes are the specific lengths of the pipes

Output

The total cost of connecting the pipes.

Sample Input

pipes[4] = {4, 3, 2, 6};

Sample Output

29