#### Printing the median of a stream of integers.

This problem deals with printing the median of a stream of integers. At each time step, the median of the integers received so far is printed out.

#### Problem

```Given a stream of integers, print out the median of the stream at each time step.
Example input:
1, 2, 3, 4, 5
Example output:
1, 1.5, 2, 2.5, 3```

#### Solution

This solution is in C++. Our A.I. can create solutions in multiple languages.
by kayakane
```#include <iostream>
#include <queue>
#include <vector>

using namespace std;

class MedianFinder {
public:
MedianFinder() {
// initialize your data structure here.
}

// Adds a number into the data structure.
if (maxHeap.empty() || num <= maxHeap.top()) {
maxHeap.push(num);
} else {
minHeap.push(num);
}

if (maxHeap.size() > minHeap.size() + 1) {
minHeap.push(maxHeap.top());
maxHeap.pop();
} else if (minHeap.size() > maxHeap.size()) {
maxHeap.push(minHeap.top());
minHeap.pop();
}
}

// Returns the median of current data stream
double findMedian() {
if (maxHeap.size() == minHeap.size()) {
return (maxHeap.top() + minHeap.top()) / 2.0;
} else {
return maxHeap.top();
}
}

private:
priority_queue<int, vector<int>, less<int>> maxHeap;
priority_queue<int, vector<int>, greater<int>> minHeap;
};

int main() {
MedianFinder mf;
cout << mf.findMedian() << endl;
cout << mf.findMedian() << endl;
cout << mf.findMedian() << endl;
cout << mf.findMedian() << endl;
cout << mf.findMedian() << endl;
return 0;
}```

A.I. Evaluation of the Solution

The candidate's solution is complete and solves the problem. The approach is to use two priority queues, one for the max heap and one for the min heap. The max heap is used to store the smaller half of the numbers and the min heap is used to store the larger half of the numbers. This approach ensures that the median can be calculated in O(1) time.

Evaluated at: 2022-12-01 02:15:42