• 문제 링크
https://www.acmicpc.net/problem/27035
• 풀이 코드
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.Arrays;
public class Main {
public static void main(String[] args) throws IOException {
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
int n = read();
int[] a = new int[n], b = new int[n];
for (int i = 0; i < n; i++) a[i] = read();
for (int i = 0; i < n; i++) b[i] = read();
Arrays.sort(a);
Arrays.sort(b);
int sum = 0;
while (n-- > 0) sum += Math.abs(a[n] - b[n]);
bw.write(String.valueOf(sum));
bw.flush();
}
private static int read() throws IOException {
int c, n = System.in.read() & 15;
while ((c = System.in.read()) > 32) n = (n << 3) + (n << 1) + (c & 15);
return n;
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 21756 지우개 - Implementation / Java (0) | 2025.09.24 |
---|---|
[백준] 11383 뚊 - Implementation / Java (0) | 2025.09.23 |
[백준] 34301 Exact Change - Greedy / Java (0) | 2025.09.21 |
[백준] 31880 K512컵 개최! - Greedy / Java (0) | 2025.09.20 |
[백준] 30156 Malvika is peculiar about color of balloons - Greedy / Java (0) | 2025.09.19 |
댓글