제출 #1148130

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1148130		pereira_oliver	Coin Collecting (JOI19_ho_t4)	Java	0 / 100	74 ms	12868 KiB

joi2019_ho_t4

import java.util.*;

public class joi2019_ho_t4 {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    List<int[]> coins = new ArrayList<>();
    for (int i = 0; i < 2 * N; i++) {
      int x = sc.nextInt();
      int y = sc.nextInt();
      coins.add(new int[]{x, y});
    }

    // Generate target positions
    List<int[]> targets = new ArrayList<>();
    for (int x = 1; x <= N; x++) {
      targets.add(new int[]{x, 1});
      targets.add(new int[]{x, 2});
    }

    // Sort coins and targets based on x-coordinate
    coins.sort((a, b) -> Integer.compare(a[0], b[0]));
    targets.sort((a, b) -> Integer.compare(a[0], b[0]));

    // Calculate minimum operations using optimal assignment
    long totalOps = 0;
    for (int i = 0; i < 2 * N; i++) {
      int[] coin = coins.get(i);
      int[] target = targets.get(i);
      totalOps += Math.abs((long) coin[0] - target[0]) + Math.abs((long) coin[1] - target[1]);
    }

    System.out.println(totalOps);
  }
}

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