목록문제/백준_자바 (102)
sm 기술 블로그
import java.util.*; import java.io.*; class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); StringBuilder sb = new StringBuilder(); PriorityQueue leftQue = new PriorityQueue(); PriorityQueue rightQue = new PriorityQueue(); for (int i = 0; i < N; i++) { int x = sc.nextInt(); if (leftQue.size() == rightQue.size()) leftQue.add(-x); else rig..
import java.util.*; import java.io.*; class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); StringBuilder sb = new StringBuilder(); PriorityQueue que = new PriorityQueue(new Comparator() { public int compare(Integer i1, Integer i2) { // 절대값의 값이 같을 경우 if (Math.abs(i1) == Math.abs(i2)) { return i1 - i2; } else { return Math.abs(i1) - Math...
import java.util.*; import java.io.*; class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); PriorityQueue que = new PriorityQueue(); StringBuilder sb = new StringBuilder(); for (int i = 0; i < N; i++) { int X = sc.nextInt(); if(X==0) { if(que.isEmpty()) { sb.append(0).append("\n"); } else { sb.append(que.remove()).append("\n"); } } else ..
import java.util.*; import java.io.*; class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); StringBuilder sb = new StringBuilder(); int N = sc.nextInt(); PriorityQueue que = new PriorityQueue(); for (int i = 0; i < N; i++) { int X = sc.nextInt(); if(X==0) { if(que.isEmpty()) { sb.append(0).append("\n"); } else { sb.append(-que.remove()).append("\n"); } } else..