Sliding Median added

Author: zerefwayne

.vscode/launch.json

@@ -0,0 +1,29 @@
+{
+    // Use IntelliSense to learn about possible attributes.
+    // Hover to view descriptions of existing attributes.
+    // For more information, visit: https://go.microsoft.com/fwlink/?linkid=830387
+    "version": "0.2.0",
+    "configurations": [
+        {
+            "name": "g++ - Build and debug active file",
+            "type": "cppdbg",
+            "request": "launch",
+            "program": "${fileDirname}/${fileBasenameNoExtension}",
+            "args": [],
+            "stopAtEntry": false,
+            "cwd": "${workspaceFolder}",
+            "environment": [],
+            "externalConsole": false,
+            "MIMode": "gdb",
+            "setupCommands": [
+                {
+                    "description": "Enable pretty-printing for gdb",
+                    "text": "-enable-pretty-printing",
+                    "ignoreFailures": true
+                }
+            ],
+            "preLaunchTask": "C/C++: g++ build active file",
+            "miDebuggerPath": "/usr/bin/gdb"
+        }
+    ]
+}

.vscode/settings.json

@@ -1,5 +1,6 @@
 {
     "files.associations": {
-        "cmath": "cpp"
+        "cmath": "cpp",
+        "iosfwd": "cpp"
     }
 }

.vscode/tasks.json

@@ -0,0 +1,26 @@
+{
+    "tasks": [
+        {
+            "type": "shell",
+            "label": "C/C++: g++ build active file",
+            "command": "/usr/bin/g++",
+            "args": [
+                "-g",
+                "${file}",
+                "-o",
+                "${fileDirname}/${fileBasenameNoExtension}"
+            ],
+            "options": {
+                "cwd": "${workspaceFolder}"
+            },
+            "problemMatcher": [
+                "$gcc"
+            ],
+            "group": {
+                "kind": "build",
+                "isDefault": true
+            }
+        }
+    ],
+    "version": "2.0.0"
+}

sliding_median.cpp

@@ -0,0 +1,75 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+typedef long long int lli;
+typedef vector<lli> vlli;
+typedef tuple<lli, lli> ii;
+typedef tuple<lli, lli, lli> iii;
+
+void task()
+{
+
+    lli lenNumbers, lenWindow;
+    cin >> lenNumbers >> lenWindow;
+
+    vector<lli> res;
+
+    vector<lli> numbers;
+
+    multiset<lli> minHeap;
+    multiset<lli, greater<lli>> maxHeap;
+
+    lli number;
+    lli currentMedian = 0;
+
+    for (lli i = 0; i < lenNumbers; i++)
+    {
+        cin >> number;
+        numbers.emplace_back(number);
+
+        if (i >= lenWindow)
+        {
+            res.emplace_back(currentMedian);
+            lli toBeRemoved = numbers[i - lenWindow];
+            if (toBeRemoved <= currentMedian)
+            {
+                maxHeap.erase(maxHeap.find(toBeRemoved));
+            }
+            else
+            {
+                minHeap.erase(minHeap.find(toBeRemoved));
+            }
+        }
+
+        maxHeap.insert(number);
+        minHeap.insert(*maxHeap.begin());
+        maxHeap.erase(maxHeap.begin());
+        if (maxHeap.size() < minHeap.size())
+        {
+            maxHeap.insert(*minHeap.begin());
+            minHeap.erase(minHeap.begin());
+        }
+        currentMedian = *maxHeap.begin();
+    }
+
+    res.push_back(currentMedian);
+
+    for (auto r : res)
+    {
+        cout << r << ' ';
+    }
+
+    cout << '\n';
+}
+
+int main()
+{
+
+    ios::sync_with_stdio(false);
+    cin.tie(NULL);
+
+    task();
+
+    return 0;
+}

sorting_and_searching/median_in_a_stream.cpp

@@ -84,10 +84,60 @@ void task()
         ans.emplace_back(currentMedian);
     }
 
-    for(auto num: ans) {
-        cout<<num<<'\n';
+    for (auto num : ans)
+    {
+        cout << num << '\n';
+    }
+}
+
+void task2()
+{
+
+    lli lenStream;
+    cin >> lenStream;
+    priority_queue<lli> maxHeap;
+    priority_queue<lli, vector<lli>, greater<lli>> minHeap;
+
+    lli currentMedian = 0;
+
+    lli number;
+
+    vector<lli> ans;
+
+    while (lenStream--)
+    {
+
+        cin >> number;
+
+        maxHeap.push(number);
+
+        minHeap.push(maxHeap.top());
+        maxHeap.pop();
+
+        if (maxHeap.size() < minHeap.size())
+        {
+            maxHeap.push(minHeap.top());
+            minHeap.pop();
+        }
+
+        if (maxHeap.size() == minHeap.size())
+        {
+            currentMedian = (lli)floor((maxHeap.top() + minHeap.top()) / 2.0);
+        }
+        else
+        {
+            currentMedian = maxHeap.top();
+        }
+
+        ans.push_back(currentMedian);
+    }
+
+    for (auto a : ans)
+    {
+        cout << a << '\t';
     }
 
+    cout << '\n';
 }
 
 int main()
@@ -96,7 +146,7 @@ int main()
     ios::sync_with_stdio(0);
     cin.tie(0);
 
-    task();
+    task2();
 
     return 0;
 }