• 문제 링크
https://www.acmicpc.net/problem/33520
• 풀이 코드
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
public class Main {
public static void main(String[] args) throws IOException {
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
int n = read(), w = 0, h = 0;
while (n-- > 0) {
int a = read(), b = read();
w = Math.max(w, Math.min(a, b));
h = Math.max(h, Math.max(a, b));
}
bw.write(String.valueOf((long) w * h));
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' 카테고리의 다른 글
[백준] 3059 등장하지 않는 문자의 합 - Implementation / Java (0) | 2025.06.13 |
---|---|
[백준] 24755 Election Paradox - Greedy / Java (0) | 2025.06.12 |
[백준] 27829 Army Strength - Greedy / Java (0) | 2025.06.10 |
[백준] 27041 Leapcow - Greedy / Java (0) | 2025.06.09 |
[백준] 33646 Pencil Crayons - Greedy / Java (0) | 2025.06.08 |
댓글