Cod sursa(job #2035617)
| Utilizator | Data | 9 octombrie 2017 18:07:58 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.7 kb |
#include <iostream>
#include <fstream>
#include <climits>
#define NMAX 200001
using namespace std;
fstream fin("heapuri.in", ios::in);
fstream fout("heapuri.out", ios::out);
int n,x,y;
int v[NMAX];
int main()
{
int i=1,j;
fin>>n;
while(fin>>x) {
switch(x) {
case 1:
fin>>v[i++];
break;
case 2:
fin>>y;
v[y]=INT_MAX;
break;
case 3:
int valMin=INT_MAX;
for(j=1; j<i; j++)
if(valMin>v[j]) valMin=v[j];
fout<<valMin<<endl;
break;
}
}
return 0;
}
