//CIS 610-251: Queues and Link Lists
//Assignment # 4 Question # 5
//Due Oct 14,1999
//Pripority Queue unordered.

#include<iostream.h>

#define MAX 5

class Queue
{
private:
	int * queue;
	int rear,front,total;
	int Remove(void);
public:
	int pqMinDelete(void);
	bool Insert(int);
	void Empty();
	bool isEmpty();
	Queue();
};	


Queue::Queue()
{
	queue=new int[MAX];
	rear=front=total=0;
	
}

//EnQueue an integer n. Successful insertion return true;
bool Queue::Insert(int n)
{
	if (rear==MAX-1) 
	{
		if (front==0) 
			return false;
		else
		{rear=0;queue[rear]=n;total++;}
	}
	else
	{
		if (rear+1 == front)
			 return false;
		else 
		{
			rear++;
			queue[rear]=n;
			total++;
		}
	}
	return true;
}

//DeQueue an integer and return it.
int Queue::pqMinDelete()
{
	if (!isEmpty())
	{

	int arr[MAX],i=0,j=0,temp=0,tot=total;
	
	for(;i<total;i++) arr[i]=Remove();
	total=0;

	for(i=0;i<tot;i++)
	{
		for(j=i;j<tot;j++) 
		{
			if (arr[j]>arr[i]) {temp=arr[i];arr[i]=arr[j];arr[j]=temp;}
		}
	}

	for(i=0;i<tot-1;i++) Insert(arr[i]);
	return arr[i];
	}
	return -1;
}

//Remove of a normal Queue
int Queue::Remove()
{
	if (!isEmpty())
	{
		if(front==MAX-1)
		{
			front=0;
			return queue[front];
		}
		else
		{
			front++;
			return queue[front];
		}

	}
	return -1;
}


//true if Queue is Empty
bool Queue::isEmpty(void)
{
	return (front==rear)? true : false;
}

//render queue empty
void Queue::Empty(void)
{
	front=rear=total=0;
}


main()
{
	Queue q;
	q.Insert(94);
	q.Insert(1);
	q.Insert(7);
	q.Insert(10);

	cout << '\n' << q.pqMinDelete();
	cout << '\n' << q.pqMinDelete();
	cout << '\n' << q.pqMinDelete();
	cout << '\n' << q.pqMinDelete();
	cout << '\n' << q.pqMinDelete();
	return 0;
}