A14211 | Swapping Problem
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given 2 arrays $a$ and $b$ , both of size $n$ . You can swap two elements in $b$ at most once (or leave it as it is), and you are required to minimize the value $$$$\sum_{i}|a_{i}-b_{i}|. $$$$
Find the minimum possible value of this sum.
Find the minimum possible value of this sum.
输入格式
The first line contains a single integer $n$ ( $1 \le n \le 2 \cdot 10^5$ ).
The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ ( $1 \le a_i \le {10^9}$ ).
The third line contains $n$ integers $b_1, b_2, \ldots, b_n$ ( $1 \le b_i \le {10^9}$ ).
The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ ( $1 \le a_i \le {10^9}$ ).
The third line contains $n$ integers $b_1, b_2, \ldots, b_n$ ( $1 \le b_i \le {10^9}$ ).
输出格式
Output the minimum value of $\sum_{i}|a_{i}-b_{i}|$ .
输入输出样例
输入 #1
5 5 4 3 2 1 1 2 3 4 5
输出 #1
4
输入 #2
2 1 3 4 2
输出 #2
2
In the first example, we can swap the first and fifth element in array $b$ , so that it becomes $[ 5, 2, 3, 4, 1 ]$ .
Therefore, the minimum possible value of this sum would be $|5-5| + |4-2| + |3-3| + |2-4| + |1-1| = 4$ .
In the second example, we can swap the first and second elements. So, our answer would be $2$ .
Therefore, the minimum possible value of this sum would be $|5-5| + |4-2| + |3-3| + |2-4| + |1-1| = 4$ .
In the second example, we can swap the first and second elements. So, our answer would be $2$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted