leetcode

0 class MedianFinder {

1 priority_queue<int> left;

2 priority_queue<int, vector<int>, greater<int>> right;

3

4 public:

5 void addNum(int num) {

6 if (left.empty() || num < left.top())

7 left.push(num);

8 else

9 right.push(num);

10

11 if (left.size() < right.size()) {

12 int temp = right.top();

13 right.pop();

14 left.push(temp);

15 }

16

17 if (left.size() - right.size() > 1) {

18 int temp = left.top();

19 left.pop();

20 right.push(temp);

21 }

22 }

23

24 double findMedian() {

25 if (left.size() > right.size())

26 return left.top();

27 else

28 return (left.top() + right.top()) * 0.5;

29 }

30 };