제출 #1147621

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1147621		leo12345	Coin Collecting (JOI19_ho_t4)	Java	0 / 100	51 ms	11076 KiB

joi2019_ho_t4

import java.io.*;
import java.util.*;

public class joi2019_ho_t4 {
    public static void main(String[] args) throws IOException {
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(bufferedReader.readLine());
        
        int N = Integer.parseInt(st.nextToken());
        int[][] coins = new int[2 * N][2];
        
        for (int i = 0; i < 2 * N; i++) {
            st = new StringTokenizer(bufferedReader.readLine());
            coins[i][0] = Integer.parseInt(st.nextToken());
            coins[i][1] = Integer.parseInt(st.nextToken());
        }

        Arrays.sort(coins, (a, b) -> {
            if (a[0] != b[0]) return Integer.compare(a[0], b[0]);
            return Integer.compare(a[1], b[1]);
        });
        
        int[][] targets = new int[2 * N][2];
        int idx = 0;
        for (int i = 1; i <= N; i++) {
            targets[idx][0] = i;
            targets[idx++][1] = 1;
            targets[idx][0] = i;
            targets[idx++][1] = 2;
        }

        Arrays.sort(targets, (a, b) -> {
            if (a[0] != b[0]) return Integer.compare(a[0], b[0]);
            return Integer.compare(a[1], b[1]);
        });
        
        long result = 0;
        for (int i = 0; i < 2 * N; i++) {
            result += Math.abs(coins[i][0] - targets[i][0]) + Math.abs(coins[i][1] - targets[i][1]);
        }
        
        System.out.println(result);
    }
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 29
• Subtask 3: 0 / 63