(int l, int r)
| 51 | } |
| 52 | |
| 53 | public static int merge(int l, int r) { |
| 54 | if (l == 0 || r == 0) { |
| 55 | return l + r; |
| 56 | } |
| 57 | if (priority[l] >= priority[r]) { |
| 58 | right[l] = merge(right[l], r); |
| 59 | up(l); |
| 60 | return l; |
| 61 | } else { |
| 62 | left[r] = merge(l, left[r]); |
| 63 | up(r); |
| 64 | return r; |
| 65 | } |
| 66 | } |
| 67 | |
| 68 | public static void add(int num) { |
| 69 | split(0, 0, head, num); |