Cod sursa(job #905403)

Utilizator PregatireONIAnamaria Cotirlea PregatireONI Data 5 martie 2013 20:00:04
Problema Heapuri Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.58 kb
#include <stdio.h>
#include <set>

using namespace std;

FILE *f,*s;

int n,i;

int x,y;

set <int> v;

int v1[200005];

int main()
{
	f=fopen("heapuri.in","r");
	s=fopen("heapuri.out","w");
	
	fscanf(f,"%d",&n);
	
	for(i=1;i<=n;i++)
	{
		fscanf(f,"%d",&x);
		
		if(x==1)
		{
			fscanf(f,"%d",&y);
			
			v.insert(y);
			
			v1[++v1[0]]=y;
		}
		
		if(x==2)
		{
			fscanf(f,"%d",&y);
			
			//fprintf(s,"%d\n",*v.find(v1[y]));
			
			//v.erase(v.find(v1[y]));
		}
		
		if(x==3)
			fprintf(s,"%d\n",*v.begin());
	}
	
	fclose(s);
	
	return 0;
}