영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
There is a 2 × n grid whose each cell contains some number of coins. The total number of coins is 2n.
Your task is to arrange the coins so that each cell contains exactly one coin. On each move you can choose any coin and move it one step left, right, up or down.
What is the minimum number of moves if you act optimally?
Input
The first input line has an integer n: the width of the grid.
After this, there are two lines that describe the grid. Each line has n integers: the number of coins in each cell.
Output
Print one integer: the minimum number of moves.
Constraints
- 1 ≤ n ≤ 10^5
예제
예제 1
4 0 1 0 1 2 0 1 3
5