너T야? 나 T(story)야….

import java.util.Comparator;import java.util.PriorityQueue;import java.util.Scanner;public class BJ11286 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); //비교연산자 구현 Comparator comparator = new Comparator() { @Override public int compare(Integer a, Integer b) { if (Math.abs(a) ..

import java.util.Collections;import java.util.PriorityQueue;import java.util.Scanner;public class BJ11279 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); PriorityQueue priorityQueue = new PriorityQueue(Collections.reverseOrder()); for (int i = 0; i  우선순위 queue 를 이용해서 한다면 쉽게 풀 수 있을 것이다.