Pagini recente » Cod sursa (job #1093789) | Cod sursa (job #2204667) | Cod sursa (job #2420979) | Cod sursa (job #1036334) | Cod sursa (job #2388050)
#include <fstream>
#include <vector>
#include <set>
#include <map>
#define intt long long
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
map <intt, intt > fr;
intt n,x , q, el=1;
intt v[200005];
map <intt, intt> :: iterator k;
map <intt, intt> :: iterator minim;
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;
}