Cod sursa(job #3235738)
| Utilizator | Data | 20 iunie 2024 22:05:29 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
#include <queue>
#include <set>
using namespace std;
ifstream cin("heapuri.in");
ofstream cout("heapuri.out");
int n,v[200005],ce,nr;
multiset<int>s;
multiset<int>::iterator it;
int main()
{
cin>>n;
for(int i=1; i<=n; i++)
{
cin>>ce;
if(ce==1)
{
nr++;
cin>>v[nr];
s.insert(v[nr]);
}
else if(ce==2)
{
int x;
cin>>x;
s.erase(s.find(v[x]));
}
else
{
it=s.begin();
cout<<*it<<'\n';
}
}
return 0;
}
