Pagini recente » Cod sursa (job #1271672) | Cod sursa (job #3196039) | Cod sursa (job #1456571) | Cod sursa (job #1014944) | Cod sursa (job #3202049)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
void p1(int n,int a[]){
int x,ok=0;
fin>>x;
for(int i=1;i<n && ok==0;i++){
if(a[i]==-1){a[i]=x;ok=1;}
}
}
void p2(int n,int a[]){
int x;
fin>>x;
for(int i=0;i<=x;i++){
if(i==x) a[i]=-1;
}
}
void p3(int n,int a[]){
int db=0,min=200000;
for(int i=0;i<n;i++){
if(a[i]<min && a[i]!=-1) {min=a[i];db++;}
}
if(db!=0) fout<<min<<endl;
}
int main()
{
int n,p;
fin>>n;
int a[200000];
for(int i=0;i<n;i++){
a[i]=-1;
}
while(fin>>p){
if(p==1) p1(n,a);
else if(p==2) p2(n,a);
else p3(n,a);
}
return 0;
}