-
Notifications
You must be signed in to change notification settings - Fork 109
/
FindMedianInAStream.cpp
107 lines (98 loc) · 2.06 KB
/
FindMedianInAStream.cpp
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
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution
{
public:
priority_queue<int> max_h;
priority_queue<int,vector<int>,greater<int>> min_h;
int top=9999999;
//Function to insert heap.
void insertHeap(int &num)
{
if(max_h.empty() && min_h.empty() && top==9999999)
top=num;
else if(num>top)
{
if(min_h.size()>max_h.size())
{
max_h.push(top);
min_h.push(num);
top=min_h.top();
min_h.pop();
}
else
{
min_h.push(num);
}
}
else if(num<top)
{
if(min_h.size()<max_h.size())
{
min_h.push(top);
max_h.push(num);
top=max_h.top();
max_h.pop();
}
else
{
max_h.push(num);
}
}
else if(num==top)
{
if(min_h.size()==max_h.size())
{
min_h.push(num);
}
else if(min_h.size()>max_h.size())
{
max_h.push(num);
}
else
{
min_h.push(num);
}
}
}
//Function to balance heaps.
void balanceHeaps()
{
}
//Function to return Median.
double getMedian()
{
if(max_h.size()==min_h.size())
return top;
else if(max_h.size()>min_h.size())
{
int k=max_h.top();
return ((k+top)*1.0)/2;
}
else {
int k=min_h.top();
return ((k+top)*1.0)/2;
}
return top;
}
};
// { Driver Code Starts.
int main()
{
int n, x;
int t;
cin>>t;
while(t--)
{
Solution ob;
cin >> n;
for(int i = 1;i<= n; ++i)
{
cin >> x;
ob.insertHeap(x);
cout << floor(ob.getMedian()) << endl;
}
}
return 0;
} // } Driver Code Ends