영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
Problem
You work at a library and want to put a number of books back on the shelves. The shelves are placed along the x-axis. Given the shelf where each book belongs (an x-coordinate between -1000 and 1000) and the maximum number of books you can carry at the same time, determine the shortest distance you must walk to put back all the books. You and the books to be put back are initially at position 0. You do not need to walk back after putting back the last book.
Input
The first line contains the integers N and K (1 ≤ N, K ≤ 100), the number of books to be put back and the number of books you can carry at the same time.
The following N lines each contain an integer x_i (-1000 ≤ x_i ≤ 1000), the x-coordinate of the shelf where each book belongs.
Output
Print an integer: the minimum distance you must walk to put back all the books.
Scoring
Your solution will be tested on a set of test groups. To earn points for a group, you must pass all test cases in that group.
| Group | Points | Constraints |
|---|---|---|
| 1 | 30 | K = 1 |
| 2 | 70 | No additional constraints. |
Explanation of Sample
For example, you can start by bringing the books that belong on shelves 3 and 4. Then you fetch the book that belongs on shelf 1, and finally you take the book that belongs on shelf -4.
예제
예제 1
4 2 3 1 4 -4
14