# LeetCode - 1005. Maximize Sum Of Array After K Negations
### 題目網址：https://leetcode.com/problems/maximize-sum-of-array-after-k-negations/
###### tags: `LeetCode` `Easy` `貪心演算法（Greedy Algorithm）`

/*
    -LeetCode format-
    Problem: 1005. Maximize Sum Of Array After K Negations
    Difficulty: Easy
    
    by Inversionpeter
*/



class Solution {
public:
    int largestSumAfterKNegations(vector<int>& A, int K) {
        sort(A.begin(), A.end());
        int sums = 0, minimum = 1 << 30;
        for (int i = 0; i != A.size(); ++i) {
            if (K && A[i] < 0) 
                sums -= A[i], --K;
            else
                sums += A[i];
            minimum = min(minimum, abs(A[i]));
        }
        return sums - (K & 1 ? (minimum << 1) : 0);
    }
};