import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); StringTokenizer st; int T = Integer.parseInt(br.readLine()); PriorityQueue maxPQ = new PriorityQueue<>(Comparator.reverseOrder()); PriorityQueue minPQ = new PriorityQueue<>(); HashMap maxVisitedNum = new HashMap<>(); HashMap minVisitedNum = new HashMap<>(); for (int t = 0; t < T; t++) { int K = Integer.parseInt(br.readLine()); maxPQ.clear(); minPQ.clear(); for (int k = 0; k < K; k++) { st = new StringTokenizer(br.readLine()); if (st.nextToken().equals("D")) { if (st.nextToken().equals("1")) { int poll = !maxPQ.isEmpty() ? maxPQ.poll() : 0; while (!maxPQ.isEmpty()) { int count = maxVisitedNum.get(poll); if (count < 1) { break; } else { maxVisitedNum.put(poll, count - 1); poll = maxPQ.poll(); } } if (!maxPQ.isEmpty()) { minVisitedNum.put(poll, minVisitedNum.get(poll) + 1); } else { maxPQ.clear(); minPQ.clear(); maxVisitedNum.clear(); minVisitedNum.clear(); } } else { int poll = !minPQ.isEmpty() ? minPQ.poll() : 0; while (!minPQ.isEmpty()) { int count = minVisitedNum.get(poll); if (count < 1) { break; } else { minVisitedNum.put(poll, count - 1); poll = minPQ.poll(); } } if (!minPQ.isEmpty()) { maxVisitedNum.put(poll, maxVisitedNum.get(poll) + 1); } else { maxPQ.clear(); minPQ.clear(); maxVisitedNum.clear(); minVisitedNum.clear(); } } } else { int num = Integer.parseInt(st.nextToken()); maxPQ.offer(num); minPQ.offer(num); maxVisitedNum.put(num, 0); minVisitedNum.put(num, 0); } } boolean flag = maxPQ.isEmpty() || minPQ.isEmpty() ? true : false; int max = !maxPQ.isEmpty() ? maxPQ.poll() : 0; int min = !minPQ.isEmpty() ? minPQ.poll() : 0; while (!maxPQ.isEmpty()){ int count = maxVisitedNum.get(max); if(count < 1) break; else { if(count > 0){ maxVisitedNum.put(max, count - 1); max = maxPQ.poll(); } } } while (!minPQ.isEmpty()){ int count = minVisitedNum.get(min); if(count < 1) break; else { if(count > 0){ minVisitedNum.put(min, count - 1); min = minPQ.poll(); } } } if (flag) { bw.write("EMPTY\n"); } else { bw.write(max + " " + min + "\n"); } } bw.flush(); bw.close(); } }

제출 #122500

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: