CF946A.Partition

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

You are given a sequence $a$ consisting of $n$ integers. You may partition this sequence into two sequences $b$ and $c$ in such a way that every element belongs exactly to one of these sequences.

Let $B$ be the sum of elements belonging to $b$ , and $C$ be the sum of elements belonging to $c$ (if some of these sequences is empty, then its sum is $0$ ). What is the maximum possible value of $B-C$ ?

输入格式

The first line contains one integer $n$ ( $1<=n<=100$ ) — the number of elements in $a$ .

The second line contains $n$ integers $a_{1}$ , $a_{2}$ , ..., $a_{n}$ ( $-100<=a_{i}<=100$ ) — the elements of sequence $a$ .

输出格式

Print the maximum possible value of $B-C$ , where $B$ is the sum of elements of sequence $b$ , and $C$ is the sum of elements of sequence $c$ .

输入输出样例

输入#1
```
3
1 -2 0
```
输出#1
```
3
```
输入#2
```
6
16 23 16 15 42 8
```
输出#2
```
120
```

说明/提示

In the first example we may choose $b={1,0}$ , $c={-2}$ . Then $B=1$ , $C=-2$ , $B-C=3$ .

In the second example we choose $b={16,23,16,15,42,8}$ , $c={}$ (an empty sequence). Then $B=120$ , $C=0$ , $B-C=120$ .

首页