Python straightforward & self-explanatory & concise
\nclass Solution:\n    def largestSumAfterKNegations(self, A: List[int], K: int) -> int:\n        heapq.heapify(A)\n        for _ in range(K):\n            heap
```\nclass Solution:\n    def largestSumAfterKNegations(self, A: List[int], K: int) -> int:\n        heapq.heapify(A)\n        for _ in range(K):\n            heapq.heappush(A, -heapq.heappop(A))\n        return sum(A)\n```
['Heap (Priority Queue)', 'Python']