Cod sursa(job #2876423)
| Utilizator | Data | 23 martie 2022 11:32:36 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <set>
#include <fstream>
using namespace std;
ifstream cin("heapuri.in");
ofstream cout("heapuri.out");
int main()
{
multiset <int> myset;
int n,x,y,v[200001],l=0;
int i;
cin>>n;
for(i=0;i<n;i++)
{
cin>>x;
if(x==1){
cin>>y;
l++;
v[l]=y;
myset.insert(y);}
else if(x==2)
{
cin>>y;
myset.erase(myset.find(v[y]));
}
else
{multiset <int> :: iterator it = myset.begin();
cout<<*it<<endl;}
}
}
