data-structures-and-algorithms/Median_of_Running_Stream.cpp at main · Open-code-source/data-structures-and-algorithms · GitHub

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
#include <bits/stdc++.h>

using namespace std;

#define vi vector<int>
#define pii pair<int>
#define vii vector<pii>
#define rep(i,a,b) for(i=a;i<b;i++)


priority_queue<int,vi,greater<int>> pqmin;
priority_queue<int,vi> pqmax;


void insert(int x){
	if(pqmax.size()==pqmin.size()){
		if(pqmax.size()==0){
			pqmax.push(x);
			return;
		}

		if(x<pqmax.top()){
			pqmax.push(x);
		}
		else{
			pqmin.push(x);
		}

	}else{
		if(pqmax.size()>pqmin.size()){
			if(x>=pqmax.top()){
				pqmin.push(x);
			}else{
				int temp=pqmax.top();
				pqmax.pop();
				pqmin.push(temp);
				pqmax.push(x);
			}
		}
		else{
			if(x<=pqmin.top()){
				pqmax.push(x);
			}
			else{

				int temp=pqmin.top();
				pqmin.pop();
				pqmax.push(temp);
				pqmin.push(x);
			}
		}
	}
}


double finmid(){
	if(pqmin.size()==pqmax.size()){
		return (pqmin.top()+pqmax.top())/2.0;
	}
	else if(pqmax.size()>pqmin.size()){
		return pqmax.top();
	}else{
		return pqmin.top();
	}

}

int main(){

	insert(10);
	cout<<finmid()<<endl;

	insert(15);
	cout<<finmid()<<endl;

	insert(21);
	cout<<finmid()<<endl;

	insert(30);
	cout<<finmid()<<endl;

	insert(18);
	cout<<finmid()<<endl;

	insert(19);
	cout<<finmid()<<endl;

	return 0;
}