Cod sursa(job #3129119)
Utilizator | Data | 12 mai 2023 17:54:28 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.09 kb |
#include <fstream>
#include <iostream>
#include <vector>
#include <set>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
int n;
int main()
{
vector <int> v;
set<int> my_heap;
in>>n;
while(n!=0)
{
int x, y;
in >> x;
if (x == 1)
{
in >> y;
v.push_back(y);
my_heap.insert(y);
}
else if (x == 2)
{
in >> y;
// for (int i = 0; i < v.size(); i++)
// if (v[i] == y)
// {
// v.erase(v.begin() + i );
// break;
// }
// cout<<v[i]<<" ";
my_heap.erase(v[y-1]);
}
else
{
// for (int i = 0; i < v.size(); i++)
// if (v[i] == y)
// {
// v.erase(v.begin() + i );
// break;
// }
out << *my_heap.begin() << endl;
}
n--;
}
}