-
Notifications
You must be signed in to change notification settings - Fork 0
/
Menghitung Median.cpp
75 lines (54 loc) · 1.13 KB
/
Menghitung Median.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
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
//void func(priority_queue<double> s){
//
// while (s.empty() == false)
// {
// cout <<"max heap ==" << s.top() << " ";
// s.pop();
// }
//}
//void func2(priority_queue<double,vector<double>,greater<double> > g){
// while (g.empty() == false)
// {
// cout <<"min heap ==" << g.top() << " ";
// g.pop();
// }
//}
int main(){
int n;
cin >> n;
priority_queue<double> s;
priority_queue<double,vector<double>,greater<double> > g;
for (int i = 1; i<=n;i++){
long double num;
cin >> num;
if(s.empty() || s.top() > num){
s.push(num);
}
else{
g.push(num);
}if (s.size() > g.size()+1){
g.push(s.top());
s.pop();
}
else if(s.size()+1 < g.size()){
s.push(g.top());
g.pop();
}
// func2(g);
//
// func( s);
if(i%2 == 0){
cout <<(s.top() + g.top())/2<< endl;
}
else if ( g.empty() == false){
cout <<g.top() << endl;
}
else {
cout <<fixed << setprecision(1)<< s.top() << endl;
}
}
return 0;
}