-
Notifications
You must be signed in to change notification settings - Fork 60
Expand file tree
/
Copy pathassignment3.cpp
More file actions
51 lines (50 loc) · 1.73 KB
/
assignment3.cpp
File metadata and controls
51 lines (50 loc) · 1.73 KB
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
#include <bits/stdc++.h>
using namespace std;
// Program to Output Median of Stream of Integers using Max Heap & Min Heap
int main ()
{
priority_queue <int, vector<int>, greater<int> > minHeap;
priority_queue <int> maxHeap;
maxHeap.push(0);
minHeap.push(99999);
int medianSum = 0;
ifstream file("Median.txt");
string str;
while (getline(file, str)) {
istringstream iss(str);
int num;
iss >> num;
if (minHeap.size() > maxHeap.size()) {
if (num > minHeap.top()) {
maxHeap.push(minHeap.top());
minHeap.pop();
minHeap.push(num);
}
else maxHeap.push(num);
// cout << "median is " << maxHeap.top() << endl;
medianSum = (medianSum + maxHeap.top()) % 10000;
} else if (maxHeap.size() > minHeap.size()) {
if (num < maxHeap.top()) {
minHeap.push(maxHeap.top());
maxHeap.pop();
maxHeap.push(num);
}
else minHeap.push(num);
// cout << "median is " << maxHeap.top() << endl;
medianSum = (medianSum + maxHeap.top()) % 10000;
}
else { // maxHeap.size() == minHeap.size()
if (num > minHeap.top()) {
minHeap.push(num);
// cout << "median is " << minHeap.top() << endl;
medianSum = (medianSum + minHeap.top()) % 10000;
}
else {
maxHeap.push(num);
// cout << "median is " << maxHeap.top() << endl;
medianSum = (medianSum + maxHeap.top()) % 10000;
}
}
}
cout << medianSum;
}