Pagini recente » Cod sursa (job #2955567) | Cod sursa (job #368014) | Cod sursa (job #1480960) | Cod sursa (job #1612759) | Cod sursa (job #3203455)
#include <fstream>
#include <set>
#include <vector>
using namespace std;
ifstream cin("heapuri.in");
ofstream cout("heapuri.out");
int n;
multiset<int> M;
vector<int> pozitie;
int t,x;
int k;
int main()
{
cin>>n;
pozitie.resize(n+1);
k=1;
for(int i=0;i<n;i++)
{
cin>>t;
switch(t)
{
case 1:
{
cin>>x;
M.insert(x);
pozitie[k++]=x;
break;
}
case 2:
{
cin>>x;
M.erase(M.lower_bound(pozitie[x]));
break;
}
case 3:
{
cout<<*M.begin()<<'\n';
}
}
}
return 0;
}