Give Current Max Problem Solved

Author: MohammadFahad1

Final Exam Problems/.cph/.Give_Current_Max.cpp_e9e666d09522d93cad577dc719298408.prob

@@ -0,0 +1 @@
+{"name":"Give Current Max","group":"HackerRank - Final Exam | Basic Data Structure | Batch 05","url":"https://www.hackerrank.com/contests/final-exam-a-basic-data-structure-a-batch-05/challenges/get-current-max","interactive":false,"memoryLimit":512,"timeLimit":4000,"tests":[{"id":1725208997893,"input":"3\nakib 23 95\njobbar 24 99\nali 25 100\n8\n1\n2\n2\n2\n0 kabir 15 65\n0 asif 55 65\n2\n0 tamim 35 65\n","output":"ali 25 100\njobbar 24 99\nakib 23 95\nEmpty\nkabir 15 65\nkabir 15 65\nasif 55 65\ntamim 35 65\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"GiveCurrentMax"}},"batch":{"id":"787b08a9-4aba-4f18-aa82-36fddeaa689c","size":1},"srcPath":"f:\\Phitron\\3. Basic Data Structures\\Final Exam Problems\\Give_Current_Max.cpp"}

Final Exam Problems/.cph/.Give_Current_Min.cpp_8b9ec0780cc591020c14217b353a8db3.prob

@@ -1 +1 @@
-{"name":"Give Current Min","group":"HackerRank - Final Exam | Basic Data Structure | Batch 05","url":"https://www.hackerrank.com/contests/final-exam-a-basic-data-structure-a-batch-05/challenges/give-max-min","interactive":false,"memoryLimit":512,"timeLimit":4000,"tests":[{"input":"4\n10 -10 -5 -20\n10\n1\n2\n2\n2\n2\n0 10\n1\n2\n0 20\n1\n","output":"-20\n-10\n-5\n10\nEmpty\n10\n10\nEmpty\n20\n20\n","id":1725200744076},{"input":"6\n45 -30 83 -99 19 75\n9\n1\n2\n2\n0 32\n0 6\n2\n2\n0 -86\n1\n","output":"-99\n-30\n19\n19\n6\n19\n32\n-86\n-86\n","id":1725200744112}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"GiveCurrentMin"}},"batch":{"id":"066d76d5-6c41-4304-96f9-11423e18e85d","size":1},"srcPath":"f:\\Phitron\\3. Basic Data Structures\\Final Exam Problems\\Give_Current_Min.cpp"}
+{"name":"Give Current Min","group":"HackerRank - Final Exam | Basic Data Structure | Batch 05","url":"https://www.hackerrank.com/contests/final-exam-a-basic-data-structure-a-batch-05/challenges/give-max-min","interactive":false,"memoryLimit":512,"timeLimit":4000,"tests":[{"input":"4\n10 -10 -5 -20\n10\n1\n2\n2\n2\n2\n0 10\n1\n2\n0 20\n1\n","output":"-20\n-10\n-5\n10\nEmpty\n10\n10\nEmpty\n20\n20\n","id":1725200744076},{"id":1725200744112,"input":"6\n45 -30 83 -99 19 75\n9\n1\n2\n2\n0 32\n0 6\n2\n2\n0 -86\n1\n","output":"-99\n-30\n19\n19\n6\n19\n32\n-86\n-86\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"GiveCurrentMin"}},"batch":{"id":"066d76d5-6c41-4304-96f9-11423e18e85d","size":1},"srcPath":"f:\\Phitron\\3. Basic Data Structures\\Final Exam Problems\\Give_Current_Min.cpp"}

Final Exam Problems/.vscode/settings.json

@@ -2,6 +2,7 @@
   "files.associations": {
     "*.embeddedhtml": "html",
     "*.js": "javascript",
-    "ostream": "cpp"
+    "ostream": "cpp",
+    "iostream": "cpp"
   }
 }

Final Exam Problems/Give_Current_Max.bin

@@ -0,0 +1,85 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+class Student
+{
+public:
+    string Name;
+    int Roll;
+    int Marks;
+    Student(string Name, int Roll, int Marks)
+    {
+        this->Name = Name;
+        this->Roll = Roll;
+        this->Marks = Marks;
+    }
+};
+
+class cmp
+{
+public:
+    bool operator()(Student a, Student b)
+    {
+        if (a.Marks < b.Marks)
+            return true;
+        else if (a.Marks > b.Marks)
+            return false;
+        else
+            return a.Roll > b.Roll;
+    }
+};
+
+int main()
+{
+    int n;
+    cin >> n;
+    priority_queue<Student, vector<Student>, cmp> pq;
+    while (n--)
+    {
+        string name;
+        int roll, marks;
+        cin >> name >> roll >> marks;
+        Student obj = Student(name, roll, marks);
+        pq.push(obj);
+    }
+
+    int q;
+    cin >> q;
+
+    while (q--)
+    {
+        int c;
+        cin >> c;
+        if (c == 0)
+        {
+            string name;
+            int roll, marks;
+            cin >> name >> roll >> marks;
+            Student obj = Student(name, roll, marks);
+            pq.push(obj);
+            cout << pq.top().Name << " " << pq.top().Roll << " " << pq.top().Marks << endl;
+        }
+        else if (c == 1)
+        {
+            if (pq.size() > 0)
+            {
+                cout << pq.top().Name << " " << pq.top().Roll << " " << pq.top().Marks << endl;
+            }
+            else
+                cout << "Empty" << endl;
+        }
+        else if (c == 2)
+        {
+            if (pq.size() > 0)
+                pq.pop();
+            if (pq.size() > 0)
+            {
+                cout << pq.top().Name << " " << pq.top().Roll << " " << pq.top().Marks << endl;
+            }
+            else
+                cout << "Empty" << endl;
+        }
+    }
+
+    return 0;
+}