Given an array A of integers, we must modify the array in the following way: we choose an i and replace A[i] with -A[i], and we repeat this process K times in total. (We may choose the same index i multiple times.)

Return the largest possible sum of the array after modifying it in this way.

Example 1:

Input: A = [4,2,3], K = 1
Output: 5
Explanation: Choose indices (1,) and A becomes [4,-2,3].

Example 2:

Input: A = [3,-1,0,2], K = 3
Output: 6
Explanation: Choose indices (1, 2, 2) and A becomes [3,1,0,2].

Example 3:

Input: A = [2,-3,-1,5,-4], K = 2
Output: 13
Explanation: Choose indices (1, 4) and A becomes [2,3,-1,5,4].
 

Note:

1. 1 <= A.length <= 10000
2. 1 <= K <= 10000
3. -100 <= A[i] <= 100

-------------------------------------------------------------------------------------------------------------------

這個題是貪心題，不過，要註意在有負數和整數的情況下，多次將其中的最小的數（負數）反轉為正數時，最後得到一系列整數時，還需要進行排序。emmm，這個地方不是可以用優先隊列吧，所以用了優先隊列，不過在時間復雜度上比較吃虧了。。。

C++代碼：

class Solution {
public:
    int largestSumAfterKNegations(vector<int>& A, int K) {
        priority_queue<int,vector<int>,greater<int> > pq;
        for(int num:A){
            pq.push(num);
        }
        int ans = 0;
        while(ans < K){
            int a = pq.top();pq.pop();
            a = -a;
            pq.push(a);
            ans++;
        }
        int sum = 0;
        while(!pq.empty()){
            sum += pq.top();
            pq.pop();
        }
        return sum;
    }
};

(貪心 優先隊列) leetcode1005. Maximize Sum Of Array After K Negations