Give_Current_Min.cpp

#include <bits/stdc++.h>
using namespace std;

int main()
{

    priority_queue<int, vector<int>, greater<int>> pq; // for only min

    int IN;
    cin >> IN;
    while (IN--)
    {
        int val;
        cin >> val;
        pq.push(val);
    }

    // Take queruy
    int Q;
    cin >> Q;

    while (Q--)
    {
        // take input of the run function
        int n;
        cin >> n;

        if (n == 0)
        { // insert
            int x;
            cin >> x;
            pq.push(x);
            cout << pq.top() << endl;
        }
        else if (n == 1) // delete
        {
            if (pq.empty())
            {
                cout << "Empty" << endl;
            }
            else
            {
                cout << pq.top() << endl;
            }
        }
        else if (n == 2)
        {
            if (pq.empty())
            {
                cout << "Empty" << endl;
            }
            else
            {
                pq.pop();
                if (pq.empty())
                {
                    cout << "Empty" << endl;
                }
                else
                {
                    cout << pq.top() << endl;
                }
            }
        }
    }

    return 0;
}