* [1127] Last Stone Weight * * We have a collection of rocks, each rock has a positive integer weight. * * Each turn, we choose the two heaviest rocks and smash them together. Suppose the stones have weights x and y with x <= y. The result of this smash is: * * * If x == y, both stones are totally destroyed; * If x != y, the stone of weight x is totally destroyed, and the stone of weig
source not stored for this graph (policy: none)
nothing calls this directly
no outgoing calls
no test coverage detected