루미 알고리즘

#1532골드Card game

PO 2022 결선코딩출제 Abdullah Zaghmout영어 원문이 문제가 어렵다면 — 배우는 순서 보기

영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)

Problem

Nicole and Simon are playing a card game consisting of N rounds. In round i, Nicole plays a card with a number a_i written on it. Simon must respond by playing a card from his hand. If Simon's card has a value b_i, Nicole scores |a_i - b_i| points. Nicole thus scores more points the farther Simon's card value is from the one Nicole played.

Given exactly which cards Nicole will play and which cards Simon has in his hand from the start, what is the minimum score Nicole can get if Simon plays optimally? If Simon has M cards, they will always play exactly M or M - 1 rounds, i.e., M = N or M = N + 1.

Input

The first line contains two integers N (1 ≤ N ≤ 2 · 10^5) and M (N ≤ M ≤ N+1), the number of rounds in the game and the number of cards Simon has.

The second line contains N integers a_1, …, a_N (0 ≤ a_i ≤ 10^9), where a_i is the value of the card Nicole plays in round i.

The third line contains M integers b_1, …, b_M (0 ≤ b_i ≤ 10^9), the values of Simon's cards.

Output

Print the minimum total score Nicole gets if Simon plays optimally.

Scoring

Your solution will be tested on a set of test groups, each worth a number of points. Each test group contains a set of test cases. To get the points for a test group you need to solve all test cases in the test group.

GroupPointsConstraints
115N ≤ 8
225N ≤ 2000
320M=N
440No additional constraints.

Explanation of Samples

In example case 1, it is optimal for Simon to play the card with value 1 in the first round, and the card with value 2 in the second round. Then Nicole gets |1-1| + |10-2| = 8 points.

In example case 2, Simon plays the cards with values 2, 5, 1, in that order.

In example case 3, Simon plays the cards with values 4, 6, 3, 1, in that order.

예제

예제 1

입력
2 3
1 10
2 0 1
출력
8

예제 2

입력
3 3
4 8 1
5 1 2
출력
5

예제 3

입력
4 5
6 10 6 2
1 4 0 6 3
출력
10

예제 4

입력
5 5
0 0 0 0 0
1000000000 1000000000 1000000000 1000000000 1000000000
출력
5000000000

출처 표기

출처: Programmeringsolympiaden 2022년 결선 · 원문 페이지 · 이용 조건 CC BY-SA · LaTeX 원문을 화면용 글로 옮겼습니다(수식·표의 모양이 다를 수 있습니다). 내용은 고치지 않았습니다.

크리에이티브 커먼즈 저작자표시-동일조건변경허락.

문제 출처: 한국정보올림피아드(KOI) (CC BY-NC-SA 4.0) · International Olympiad in Informatics (IOI) (CC BY) · Centre for Education in Mathematics and Computing (CEMC), University of Waterloo (CC BY-NC 4.0) · Programmeringsolympiaden (CC BY-SA) · CSES Problem Set (Antti Laaksonen) (CC BY-NC-SA 4.0). 루미 알고리즘은 위 단체들과 관계없는 별도의 서비스이며, 자료는 원문 그대로 싣습니다. 문제마다 출처와 이용 조건을 따로 표기합니다.