程序设计，合并果子
例如有3种果子，数目依次为1，2，9。合并方案如下：

1. 将1、2合并，得到新堆数目为3，耗费体力为3。

2. 将新堆与第三堆合并，又得到新堆，数目为12，耗费的体力为12。

3. 总共消耗体力为 3 + 12 = 15，可以证明15为最小的体力耗费值。

输入

输入包括两行，第一行是一个整数 n (1<＝n<=10000)，表示果子的种类数。第二行包含 n 个整数，用空格分隔，第 i 个整数 ai (1<＝ai<=10000)是第 i 种果子的数目。(Programming combines fruit
For example, there are 3 kinds of fruit, the number is 1, 2, 9. The merger scheme is as follows:
1. combined 1 and 2, the new heap number is 3, and the physical strength is 3.
2. combine the new heap with the third heap, and get the new heap, the number is 12, the energy consumption is 12.
3. of the total physical exertion was 3 + 12 = 15, and 15 could be proved to be the minimum physical exertion value.
input
The input consists of two rows, and the first line is an integer n (1< = n<=10000) indicating the number of fruits. The second line contains n integers, separated by spaces. The first I integer AI (1< = ai<=10000) is the number of the first I species.)