Cod sursa(job #3307308)
| Utilizator | Data | 20 august 2025 09:54:47 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#include <vector>
#include <set>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
int n;
vector<int> v;
multiset<int> s;
int main()
{
in>>n;
int a, b;
while(n--)
{
in>>a;
if(a == 1)
{
in>>b;
v.push_back(b);
s.insert(b);
}
else if(a == 2)
{
in>>b;
int x = v[b - 1];
s.erase(s.find(x));
}
else
{
out<<*s.begin()<<'\n';
}
}
return 0;
}
