Timer is Running

There are given **N** ropes of different lengths, we need to connect these ropes into one rope. The cost to connect two ropes is equal to sum of their lengths. The task is to connect the ropes with minimum cost.

**Input:**

The first line of input contains an integer T denoting the number of test cases. The first line of each test case is N where N is the number of ropes. The second line of each test case contains N input L[i],length of ropes.

**Output:**

For each testcase, print the minimum cost to connect all the ropes.

**Constraints:**

1 ≤ T ≤ 100

1 ≤ N ≤ 10^{6}

1 ≤ L[i] ≤ 10^{6}

**Example:**

**Input:**

2

4

4 3 2 6

5

4 2 7 6 9

**Output:**

29

62

**Explanation:**

For example if we are given 4 ropes of lengths 4, 3, 2 and 6. We can connect the ropes in following ways.

1) First connect ropes of lengths 2 and 3. Now we have three ropes of lengths 4, 6 and 5.

2) Now connect ropes of lengths 4 and 5. Now we have two ropes of lengths 6 and 9.

3) Finally connect the two ropes and all ropes have connected.

Total cost for connecting all ropes is 5 + 9 + 15 = 29. This is the optimized cost for connecting ropes. Other ways of connecting ropes would always have same or more cost. For example, if we connect 4 and 6 first (we get three strings of 3, 2 and 10), then connect 10 and 3 (we get two strings of 13 and 2). Finally we connect 13 and 2. Total cost in this way is 10 + 13 + 15 = 38.

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

abnandi04 | 801 |

KshamaGupta | 562 |

mummy | 326 |

jagseersinghbe18cse | 296 |

ponnadasaikesav | 292 |

abnandi04 | 776 |

KshamaGupta | 446 |

yogesh_aka_dante | 288 |

ponnadasaikesav | 269 |

mummy | 239 |

blackshadows | 5362 |

Ibrahim Nash | 5244 |

akhayrutdinov | 5111 |

mb1973 | 4976 |

Quandray | 4748 |

Login to report an issue on this page.