|BEATS 100% ✅ ||C++✅ ||STACK✅||UNIQUE✅|
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```cpp []
class Solution {
public:
    int largestSumAfterKNegations(vector<int>& nums, int k) {
       sort(nums.begin(),nums.end());
        int n=nums.size(),mini=INT_MAX,sum=0;
        for(int i=0;i<n;i++){
            if(k && nums[i]<0){
                nums[i]=-1*nums[i];
                k--;
            }
        }
        for(int i=0;i<n;i++){
           mini=min(mini,nums[i]);
           sum+=nums[i];
        }
        k=k%2;
        
        if(mini>0 && k){
            sum-=2*mini;

        }
        if(mini<0 && k){
            sum+=-2*mini;
        }
        return sum;
               
    }
};
```
['C++']