• 문제 링크
https://www.acmicpc.net/problem/15366
• 풀이 코드
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[] x = new int[n], y = new int[n];
for (int i = 0; i < n; i++) x[i] = read();
for (int i = 0; i < n; i++) y[i] = read();
Arrays.sort(x);
Arrays.sort(y);
boolean flag = true;
while (n-- > 0) {
if (x[n] > y[n]) {
flag = false;
break;
}
}
bw.write(flag ? "DA" : "NE");
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' 카테고리의 다른 글
[백준] 2167 2차원 배열의 합 - Implementation / Java (0) | 2024.05.17 |
---|---|
[백준] 1475 방 번호 - Implementation / Java (0) | 2024.05.16 |
[백준] 6147 Bookshelf - Greedy / Java (0) | 2024.05.14 |
[백준] 25335 Gravity Hackenbush - Greedy / Java (0) | 2024.05.13 |
[백준] 16756 Pismo - Greedy / Java (0) | 2024.05.12 |
댓글