[PYTHON 3] Min Heap | Few - Lines | Easy to Read Solution
\nclass Solution:\n    def largestSumAfterKNegations(self, min_heap: List[int], K: int) -> int:\n        heapify(min_heap)\n        while K > 0:\n            he
```\nclass Solution:\n    def largestSumAfterKNegations(self, min_heap: List[int], K: int) -> int:\n        heapify(min_heap)\n        while K > 0:\n            heappush(min_heap , - (heappop(min_heap)))            \n            K -= 1\n        return sum(min_heap)\n```
['Heap (Priority Queue)', 'Python3']