Cod sursa(job #1101809)
| Utilizator | Data | 9 februarie 2014 04:11:39 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
#include <set>
using namespace std;
set <int> H;
int ORD[20005],k;
int main()
{
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int N , X , TIP; f >> N;
for( int i=1; i<=N; ++i ){
f >> TIP;
if( TIP == 1 ){
f >> X;
H.insert(X);
ORD[ ++k ]=X;
}
else
if( TIP == 2 ){
f >> X;
H.erase( ORD[X] );
}
else
g<< *H.begin() <<'\n';
}
f.close();
g.close();
return 0;
}
