Introduction - If you have any usage issues, please Google them yourself
In an orchard, a lot has shot down all the fruit, and the fruit is divided into different types according to different stack. We decided to put all the fruit of a lot of synthetic pile. Every merger, a lot of fruit into two piles can put together, physical consumption equal to the weight of the fruit and piles. As can be seen, all the fruit after n-1 merger, on the left a pile. When you merge a lot of fruit in the total consumption of physical strength equal to the sum of the consumption of each merger. Because it will take great effort to put these fruits to move back home, so a lot of fruit in consolidation to save energy as much as possible. The number of species and the number of each fruit is assumed that each fruit weight is 1, and the fruit is known, your task is to design a combined order of programs to spend a lot of physical minimum, and output value of the minimum physical cost. For example there are three kinds of fruit, followed by the number 1,2,9. 1,2 heap can first merg