python, heapq (min) with negative values (equivalent to heap max)
https://leetcode.com/submissions/detail/875123729/  \nRuntime: 29 ms, faster than 94.25% of Python3 online submissions for Last Stone Weight.  \nMemory Usage: 1
https://leetcode.com/submissions/detail/875123729/  \nRuntime: **29 ms**, faster than 94.25% of Python3 online submissions for Last Stone Weight.  \nMemory Usage: 13.8 MB, less than 61.08% of Python3 online submissions for Last Stone Weight.  \n```\nclass Solution:\n    def lastStoneWeight(self, stones: List[int]) -> int:\n        s = [-s for s in stones]\n        heapify(s)\n        while len(s)>1:\n            heapq.heappush(s, -abs(heappop(s) - heappop(s)))\n        return -s[0]\n```
['Heap (Priority Queue)', 'Python', 'Python3']