Cod sursa(job #857721)
Utilizator | Data | 18 ianuarie 2013 11:58:11 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
#include <set>
using namespace std;
std::multiset<int> s;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int n, x, nr,a[200005],y;
int main()
{
int i;
f>>n;
nr=0;
for(i=1;i<=n;i++)
{
f>>x;
if (x==1)
{f>>a[++nr];s.insert(a[nr]);}
else
if (x==2)
{
f>>y;
s.erase(s.find(a[y]));
}
else
if(x==3)
g<<*s.begin()<<"\n";
}
return 0;
}