A11588 | Partition
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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$ ?
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$ .
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$ .
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$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted