<p>You are given two integers, <code>m</code> and <code>k</code>, and a stream of integers. You are tasked to implement a data structure that calculates the <strong>MKAverage</strong> for the stream.</p> <p>The <strong>MKAverage</strong> can be calculated using these steps:</p> <ol> <li>If the number of the elements in the stream is less than <code>m</code> you should consider the <strong>MKAverage</strong> to be <code>-1</code>. Otherwise, copy the last <code>m</code> elements of the stream to a separate container.</li> <li>Remove the smallest <code>k</code> elements and the largest <code>k</code> elements from the container.</li> <li>Calculate the average value for the rest of the elements <strong>rounded down to the nearest integer</strong>.</li> </ol> <p>Implement the <code>MKAverage</code> class:</p> <ul> <li><code>MKAverage(int m, int k)</code> Initializes the <strong>MKAverage</strong> object with an empty stream and the two integers <code>m</code> and <code>k</code>.</li> <li><code>void addElement(int num)</code> Inserts a new element <code>num</code> into the stream.</li> <li><code>int calculateMKAverage()</code> Calculates and returns the <strong>MKAverage</strong> for the current stream <strong>rounded down to the nearest integer</strong>.</li> </ul> <p> </p> <p><strong>Example 1:</strong></p> <pre> <strong>Input</strong> ["MKAverage", "addElement", "addElement", "calculateMKAverage", "addElement", "calculateMKAverage", "addElement", "addElement", "addElement", "calculateMKAverage"] [[3, 1], [3], [1], [], [10], [], [5], [5], [5], []] <strong>Output</strong> [null, null, null, -1, null, 3, null, null, null, 5] <strong>Explanation</strong> MKAverage obj = new MKAverage(3, 1); obj.addElement(3); // current elements are [3] obj.addElement(1); // current elements are [3,1] obj.calculateMKAverage(); // return -1, because m = 3 and only 2 elements exist. obj.addElement(10); // current elements are [3,1,10] obj.calculateMKAverage(); // The last 3 elements are [3,1,10]. // After removing smallest and largest 1 element the container will be <code>[3]. // The average of [3] equals 3/1 = 3, return 3 obj.addElement(5); // current elements are [3,1,10,5] obj.addElement(5); // current elements are [3,1,10,5,5] obj.addElement(5); // current elements are [3,1,10,5,5,5] obj.calculateMKAverage(); // The last 3 elements are [5,5,5]. // After removing smallest and largest 1 element the container will be <code>[5]. // The average of [5] equals 5/1 = 5, return 5 </code></code></pre> <p> </p> <p><strong>Constraints:</strong></p> <ul> <li><code>3 <= m <= 10<sup>5</sup></code></li> <li><code>1 <= k*2 < m</code></li> <li><code>1 <= num <= 10<sup>5</sup></code></li> <li>At most <code>10<sup>5</sup></code> calls will be made to <code>addElement</code> and <code>calculateMKAverage</code>.</li> </ul>