Status: IN
The k-negations algorithm sorts to place negatives first and greedily flips them; this is optimal because flipping a negative yields +2|x| gain versus flipping a positive which yields -2|x| loss.
Source: entries/2026/06/06/maximize-sum-of-array-after-k-negations-solution.md