Maximize sum after K negations.cpp

//{ Driver Code Starts
#include<bits/stdc++.h>
using namespace std;

// } Driver Code Ends
class Solution{
    public:
    long long int sumArray(long long int* a, int n)
{
    long long int sum = 0;
 
    for (int i = 0; i < n; i++)
        sum += a[i];
    return sum;
}
    long long int maximizeSum(long long int a[], int n, int k)
    {
        // Your code goes here
        sort(a, a + n);
    int i = 0;
 
    
    for (i = 0; i < n; i++) {
        if (k && a[i] < 0) {
            a[i] *= -1;
            k--;
            continue;
        }
        break;
    }
    if (i == n)
        i--;
    if (k == 0 || k % 2 == 0)
        return sumArray(a, n);
    if (i != 0 && abs(a[i]) >= abs(a[i - 1]))
        i--;
    a[i] *= -1;
    return sumArray(a, n);
    }
};

//{ Driver Code Starts.
int main()
 {
     int t;
     cin>>t;
     while(t--)
     {
         int n, k;
         cin>>n>>k;
         long long int a[n+5];
         for(int i=0;i<n;i++)
         cin>>a[i];
         Solution ob;
         cout<<ob.maximizeSum(a, n, k)<<endl;
     }
	
	return 0;
}
// } Driver Code Ends