Home BOJ. Maximum heap (11279)
Post
Cancel

BOJ. Maximum heap (11279)

[Link] https://www.acmicpc.net/problem/11279


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
import java.util.*;
import java.io.*;

public class Main {
  public static void main(String[] args) throws IOException {
    Heap heap = new Heap();
    StringBuilder sb = new StringBuilder();
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    int N = atoi(br.readLine());
    for(int i = 0; i < N; i++) {
      int n = atoi(br.readLine());
      if(n == 0) sb.append(heap.pop()).append("\n");
      else heap.insert(n);
    }
    System.out.println(sb);
  }

  public static class Heap{
    ArrayList<Integer> al = new ArrayList<>();
    int size;

    Heap() { al.add(null); }

    void insert(int val) {
      al.add(val);
      int idx = al.size() - 1;
      while(idx / 2 >= 1) {
        int pIdx = idx / 2;
        int parent = al.get(pIdx);
        if(parent < val) {
          al.set(pIdx, al.get(idx));
          al.set(idx, parent);
        } else break;
        idx = pIdx;
      }
    }

    int pop() {
      int size = al.size(), idx = 1;
      if(size <= 1) return 0;
      int v = al.get(size - 1);
      int topV = al.set(1, v);
      al.remove(size - 1);
      size--;
      while(idx * 2 < size) {
        int l = idx * 2, r = l + 1, maxIdx;
        if(r < size) maxIdx = al.get(l) > al.get(r) ? l : r;
        else maxIdx = l;
        if(al.get(maxIdx) <= v) break;
        al.set(idx, al.get(maxIdx));
        al.set(maxIdx, v);
        idx = maxIdx;
      }
      return topV;
    }
  }

  private static int atoi(String s) { return Integer.parseInt(s); }
}
This post is licensed under CC BY 4.0 by the author.