LeetCode:1005. K 次取反后最大化的数组和

class Solution {
public:
    int largestSumAfterKNegations(vector<int>& A, int K) {
        while(K)
        {
            sort(A.begin(),A.end());
            A[0]=-A[0];
            K--;
        }
        return accumulate(A.begin(),A.end(),0);
    }
};