Cod sursa(job #1851602)
Utilizator | Data | 19 ianuarie 2017 21:49:44 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.72 kb |
#include <iostream>
#include <fstream>
#include <set>
#define dim 200005
using namespace std;
ifstream f ("heapuri.in");
ofstream g ("heapuri.out");
int vec[dim],n,i,caz,x,nr;
int main()
{
multiset <int> filip; multiset <int> ::iterator it;
int val;
f >> n;
for(i = 1; i <= n; i++)
{
f >> caz;
switch(caz)
{
case 1:
f >> x;
vec[++nr] = x;
filip.insert(x);
break;
case 2:
f >> x;
filip.erase(filip.find(vec[x]));
break;
default:
it = filip.begin();
g << *it << '\n';
break;
}
}
return 0;
}