Cod sursa(job #3265014)
| Utilizator | Data | 26 decembrie 2024 14:29:32 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#include <set>
#include <queue>
using namespace std;
ifstream cin("heapuri.in");
ofstream cout("heapuri.out");
int n,v[200005],k;
multiset<int>s;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
int cer;
cin>>cer;
if(cer==1)
{
int x;
cin>>x;
v[++k]=x;
s.insert(x);
}
else if(cer==2)
{
int x;
cin>>x;
s.erase(v[x]);
}
else
{
cout<<*s.begin()<<'\n';
}
}
return 0;
}
