Minimum Cost to Cut a Stick

Given a stick of length n and an array of integer positions representing the positions where the stick is to be cut, find the minimum total cost of cutting the stick at those positions. The cost of cutting the stick at position p is the sum of the lengths of the two resulting sticks.