Datasets:

ArXiv:
License:
File size: 2,213 Bytes
c574d3a
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
import java.io.*;

import java.util.*;



public class Median {



  public static class MedianPriorityQueue {

    PriorityQueue<Integer> left;

    PriorityQueue<Integer> right;



    public MedianPriorityQueue() {

      left = new PriorityQueue<>(Collections.reverseOrder());

      right = new PriorityQueue<>();

    }



    public void add(int val) {

      // write your code here

      

      if(right.size() >0 && val > right.peek()){

          right.add(val);

      }

      else{

          left.add(val);

      }

      

      if(left.size() - right.size()==2){

          right.add(left.remove());

      }

      else if(right.size() - left.size()==2){

          left.add(riht.remove());

      }

    }



    public int remove() {

      // write your code here

      if(this.size() == 0){

          return -1;

      }

      else if(left.size() >= right.size()){

          return left.remove();

      }

      else{

          return right.remove();

      }

    }



    public int peek() {

      // write your code here

      

      if(this.size() == 0){

          return -1;

      }

      else if(left.size() >= right.size()){

          return left.peek();

      }

      else{

          return right.peek();

      }

      

    }



    public int size() {

      // write your code here

      return left.size()+right.size();

    }

  }



  public static void main(String[] args) throws Exception {

    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

    MedianPriorityQueue qu = new MedianPriorityQueue();



    String str = br.readLine();

    while (str.equals("quit") == false) {

      if (str.startsWith("add")) {

        int val = Integer.parseInt(str.split(" ")[1]);

        qu.add(val);

      } else if (str.startsWith("remove")) {

        int val = qu.remove();

        if (val != -1) {

          System.out.println(val);

        }

      } else if (str.startsWith("peek")) {

        int val = qu.peek();

        if (val != -1) {

          System.out.println(val);

        }

      } else if (str.startsWith("size")) {

        System.out.println(qu.size());

      }

      str = br.readLine();

    }

  }

}