Cod sursa(job #1611986)
| Utilizator | Data | 24 februarie 2016 17:13:05 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
multiset <int> h;
int v[2000000],i,j,n,m;
int main()
{
fin>>n;
for( i = 1 ; i <= n ; i++ )
{
fin>>m;
if( m == 1 )
{
fin>>j;
v[ ++v[ 0 ] ] = j;
h.insert( j );
}
else if( m == 2 )
{
fin>>j;
h.erase( v[ j ] );
}
else
{
fout<<*(h.begin())<<'\n';
}
}
return 0;
}
