Firebending

View as PDF

Submit solution

All submissions

Best submissions

Points: 3

Time limit: 1.0s

Memory limit: 16M

Author:

thorthugnasty

Problem type

Vincent Massey SS - 2014 Senior Contest #1

Firebending is the element of power. Firebenders use their energy to create bursts of fire in order to overwhelm their opponent. As a result, they want to maximize the value of each fire blast that they shoot. In order to do so, they must revisit the art of mathematics.

You will be given $n$ $n$ integers, one per line. For each of the integers, $k_i$ $k_{i}$ , you can either keep it as $k_i$ $k_{i}$ , or change it to $-k_i$ $- k_{i}$ . Find the maximum possible final sum of all the integers.

Input Specification

The first line will contain the integer $n$ $n$ $(1 \le n \le 100\,000)$ $(1 \leq n \leq 100 000)$ .
The next $n$ $n$ lines will contain the integers $k_i$ $k_{i}$ .

Output Specification

The largest possible final sum of the $n$ $n$ integers.

Sample Input

Copy

Sample Output

Copy

Explanation

Keep $1$ $1$ .
Change $-2$ $- 2$ to $2$ $2$ .
Keep $3$ $3$ .
Thus, the answer is $1 + 2 + 3 = 6$ $1 + 2 + 3 = 6$ .

Comments

0

Fares_X commented on Feb. 13, 2023, 8:55 p.m.

Being negative can never contribute to maximizing your happiness.