README.md

[Bronze I] Olivander - 15366

문제 링크

성능 요약

메모리: 2020 KB, 시간: 0 ms

분류

구현, 정렬

제출 일자

2024년 8월 17일 07:24:14

문제 설명

Harry Potter has damaged his magic wand in a fight with Lord Voldemort. He has decided to get a new wand in Olivander's wand shop. On the floor of the shop, he saw N wands and N wand boxes. The lengths of the wands are, respectively, X₁, X₂, ...X_n, and the box sizes are Y₁,Y₂, ...Y_n. A wand of length X can be placed in a box of size Y if X ≤ Y. Harry wants to know if he can place all the wands in boxes so that each box contains exactly one wand. Help him solve this difficult problem.

입력

The first line of input contains the positive integer N (1 ≤ N ≤ 100), the number from the task.

The second line contains N positive integers X_i (1 ≤ X_i ≤ 10⁹), the numbers from the task.

The third line contains N positive integers Y_i (1 ≤ Y_i ≤ 10⁹), the numbers from the task.

출력

If Harry can place all the wands in boxes, output “DA” (Croatian for yes), otherwise output “NE” (Croatian for no).