Geeksforgeeks Solution For " Maximize sum after K negations "

GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of  School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers 

Problem :- Given an array of size n and a number k. We must modify array K number of times. Here modify array means in each operation we can replace any array element arr[i] by -arr[i]. We need to perform this operation in such a way that after K operations, sum of array must be maximum?

Submit Your Solution :- Click Here 

Solution :- 

using namespace std;

int maximumSum(int arr[], int n, int k)
    for (int i=1; i<=k; i++)
        int min = INT_MAX;
        int index = -1;
        for (int j=0; j<n; j++)
            if (arr[j] < min)
                min = arr[j];
                index = j;
        if (min == 0)

        arr[index] = -arr[index];
    int sum = 0;
    for (int i=0; i<n; i++)
        sum += arr[i];
    return sum;

int main()
int t;
        int n,i,k,res=0;
        int arr[n];

    cout << maximumSum(arr, n, k);
return 0;


Geeksforgeeks Solution For " Maximize sum after K negations "

Previous Post
Next Post

post written by:

Hi, I’m Ghanendra Yadav, SEO Expert, Professional Blogger, Programmer, and UI Developer. Get a Solution of More Than 500+ Programming Problems, and Practice All Programs in C, C++, and Java Languages. Get a Competitive Website Solution also Ie. Hackerrank Solutions and Geeksforgeeks Solutions. If You Are Interested to Learn a C Programming Language and You Don't Have Experience in Any Programming, You Should Start with a C Programming Language, Read: List of Format Specifiers in C.
Follow Me