Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 5725 |

@blackshadows | 5685 |

@akhayrutdinov | 5111 |

@mb1973 | 4989 |

@Quandray | 4908 |

@saiujwal13083 | 4156 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3511 |

@sushant_a | 3453 |

@KshamaGupta | 3318 |

@the_coder95 | 3302 |

Complete Leaderboard | |

Handle | Score |

@avaiesshaik782 | 786 |

@arpitsatnalika | 777 |

@tujhekya | 602 |

@prakharxyz | 601 |

@code_it_ | 591 |

@iamronak | 505 |

@imnm | 500 |

@pradeepkumarjad | 488 |

@satyam0460 | 481 |

@nitesha125 | 468 |

@Rahul Jadhav 1 | 466 |

Complete Leaderboard |

Given an array of integers of size **N** and a number **K**. Your must modify array K number of times. Here modify array means in each operation you can replace any array element either **arr[i] by -arr[i]** or **-arr[i] by arr[i]**. You need to perform this operation in such a way that after K operations, sum of array must be maximum.

**Input:**

The first line of input contains an integer **T** denoting the number of test cases. Then T test cases follow. Each test case consist of two lines . The first line of each test case contains an integer N and K. The second line of each test case contains N space separated integers denoting elements of the array.

**Output:**

For each test case, print maximum possible sum.

**Constraints:**

1 ≤ T ≤ 100

1 ≤ N ≤ 10^{7}

-10^{18} ≤ A_{i} ≤ 10^{18}

**Example:**

**Input:**

2

5 1

1 2 -3 4 5

10 5

5 -2 5 -4 5 -12 5 5 5 20

**Output:**

15

68

**Explanation:
Testcase 1: **In testcase 1 we have k=1 so we can change -3 to 3 and sum all the elements to produce 15 as output.

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Maximize sum after K negations

...

Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.