PivotOJ

Air Cownditioning

시간 제한: 2000ms메모리 제한: 1024MB출처: USACO 2021 December BronzeBOJ 23879

문제

Farmer John's cows NN are very particular about the room temperature in their barn. Some cows like the temperature to be on the cooler side, while others prefer more warmth.

Farmer John's barn contains a sequence of NN stalls, numbered 1N1 \ldots N, each containing a single cow. The ii-th cow prefers the temperature of her stall to be pip_i, and right now the temperature in her stall is tit_i. In order to make sure every cow is comfortable, Farmer John installs a new air conditioning system that is controlled in a somewhat interesting way. He can send commands to the system telling it to either raise or lower the temperature in a consecutive series of stalls by 1 unit --- for example "raise the temperature in stalls 585 \ldots 8 by 1 unit". The series of stalls could be as short as just a single stall.

Please help Farmer John determine the minimum number of commands he needs to send his new air conditioning system so that every cow's stall is at the ideal temperature for its resident cow.

입력

The first line of input contains NN. The next line contains the NN non-negative integers p1pNp_1 \ldots p_N, separated by spaces. The final line contains the NN non-negative integers t1tNt_1 \ldots t_N.

출력

Please write a single integer as output containing the minimum number of commands Farmer John needs to use.

예제

예제 1

입력
5
1 5 3 3 4
1 2 2 2 1
출력
5
코드를 제출하려면 로그인하세요.