GSHOP - Rama and Friends
Mahesh and Ramashish are good friends. Each day Ramashish gives an array arr[0,1,2...,n-1] of size 'n' to Mahesh and asks him to modify it.
Modifying an array means to execute the following operation exactly 'k' times:
- "Replace any array element 'x' by '-x' i.e multiply it by -1."
Note that this operation can be performed on an array element zero,one or more times. But while modifying the array, Mahesh should also keep in mind that the sum of the elements of the final array should be maximum possible. Mahesh wants to go to sleep so he has to finish this job as soon as possible. Can you help him?
First line of the input contains the number of test cases 'T'. Then follow 2T lines describing the test cases(Two lines for every test case).
For each test case, First line has two space separated integers 'n' (Number of elements in the array) and 'k' (Number of times to execute the operation described above) and the next line has 'n' space separated integers in non-decreasing order which are the array elements.
- 1 <= T <=10
- 1 <= n <= 100
- 1 <= k <= 100
For each 0 <= i <= n-1, -10^5 <= arr[i] <= 10^5.
Output T lines, one for each test case denoting the maximum possible sum which can be obtained after modifying the array.
Input: 1 3 1 -1 -1 1 Output: 1
problem is very easy but. those who are getting wrong ans .. if you are calculating total in starting and then calulating min and then substracting min .... substract 2*min...
Lot of Corner Cases
simple one no need to sort. elements are already in increasing order.
can be done without sorting....just need to check for different values of k.....
Nice problem ....
take care of side cases.
5 mint ....Sorting+....:P AC!!!!!
k can be greater than n..Last edit: 2015-10-23 09:19:09
carefully find all cases......use sort.....no check for n......n got AC:-)
Can't believe ! 0.2 for this! holy shit