Pagini recente » Cod sursa (job #2152172) | Cod sursa (job #2154609) | Cod sursa (job #614435) | Cod sursa (job #2302744) | Cod sursa (job #2388043)
#include <fstream>
#include <vector>
#include <set>
#include <map>
#define intt int
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int v[200002];
map <intt, intt > fr;
intt n,x , sol = n, q, el=1;
map <intt, intt> :: iterator k;
map <intt, intt> :: iterator minim;
set <int> myset;
int main()
{
f >> n;
for(intt i = 1; i <= n; ++i)
{
f >> q;
if(q == 1)
{
f >> x;
fr[x] = 1;
v[el++]=x;
}
else if(q == 2)
{
f >> x;
fr.erase(v[x]);
}
else if(q == 3)
g << fr.begin() -> first << '\n';
}
g.close();
return 0;
}