A9043 | Yaroslav and Sequence
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Yaroslav has an array, consisting of $(2·n-1)$ integers. In a single operation Yaroslav can change the sign of exactly $n$ elements in the array. In other words, in one operation Yaroslav can select exactly $n$ array elements, and multiply each of them by -1.
Yaroslav is now wondering: what maximum sum of array elements can be obtained if it is allowed to perform any number of described operations?
Help Yaroslav.
Yaroslav is now wondering: what maximum sum of array elements can be obtained if it is allowed to perform any number of described operations?
Help Yaroslav.
输入格式
The first line contains an integer $n$ $(2<=n<=100)$ . The second line contains $(2·n-1)$ integers — the array elements. The array elements do not exceed $1000$ in their absolute value.
输出格式
In a single line print the answer to the problem — the maximum sum that Yaroslav can get.
输入输出样例
输入 #1
2 50 50 50
输出 #1
150
输入 #2
2 -1 -100 -1
输出 #2
100
In the first sample you do not need to change anything. The sum of elements equals $150$ .
In the second sample you need to change the sign of the first two elements. Then we get the sum of the elements equal to $100$ .
In the second sample you need to change the sign of the first two elements. Then we get the sum of the elements equal to $100$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted