Contests | Virtual Contests | Problems | Submit | Runs Status | Rank List | Forum |

Time Limit: 2.0 Seconds Memory Limit: 65536K

Total Runs: 2020 Accepted Runs: 1027

Given *n* piles of stones, now we want to combine them into one pile.
In order to finish this job, first we can select two piles arbitrarily,
combine them into one; then select two piles from the remaining piles
arbitrarily, combine them into one pile, and so on .. until there is only
one pile. When we combine two piles, we need to cost some energy, and the
cost is related to the number of stones in the small pile. That is to say:
If we combine two piles of the size 3 and 5, the energy cost is 3. Now our
task is: given the size of the *n* piles, colculate how much energy we
need to finish the job at least?

The first line of the input is a single integer *t*, representing the
number of test cases. The 2*i*-th and the 2*i*+1 -th lines describe
the *i*-th test case. The 2*i*-th line gives the integer *n*,
then the 2*i*+1 -th line gives *n* integers - the size of each pile.
(0 < *n* ≤ 100000, and the size of each pile is no more than 1000).

For each test cases, output a single integer: the minmun energy we should cost.

1 4 5 9 6 3

`
14
`

Maintance:G.D.Retop. Developer: SuperHacker, G.D.Retop