Cod sursa(job #2388068)
Utilizator | Data | 25 martie 2019 17:07:51 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
map<long long,long long>mp;
int n,nr,v[200005],z=1;
int main()
{
in>>n;
int c;
for(int i=1;i<=n;i++)
{
in>>c;
if(c==1)
{
in>>nr;
mp[nr]=1;
v[z++]=nr;
}
if(c==2)
{
in>>nr;
mp.erase(v[nr]);
}
if(c==3)
{
out<<mp.begin()->first<<'\n';
}
}
return 0;
}