Priority_Queue_2.cpp

#include<iostream>
using namespace std;
#define SIZE 10
struct Item{
	int value;
	int priority;
};
Item pq[SIZE];
int pqSize = 0;
void enqueue(int value, int priority){
	if(pqSize == SIZE){
		cout<<"Queue is full!"<<endl;
		return;
	}
	pq[pqSize].value=value;
	pq[pqSize].priority=priority;
	pqSize++;
}
int peekIndex(){
	if(pqSize == 0){
		return -1;
	}
	int best = 0;
	for(int i=1;i<pqSize;i++){
		if(pq[i].priority>pq[best].priority){
			best = i;
		}
	}
	return best;
}
void dequeue(){
	int idx = peekIndex();
	if(idx==-1){
		cout<<"Queue is empty!"<<endl;
		return;
	}
	cout<<"Removed: "<<pq[idx].value<<endl;
	for(int i=idx;i<pqSize - 1;i++){
		pq[i]=pq[i+1];
	}
	pqSize--;
}
int main(){
	enqueue(10, 2);
	enqueue(20, 1);
	enqueue(30, 3);
	cout<<"Before Dequeue -> highest priority: "<<pq[peekIndex()].value<<endl;
	dequeue();
	cout<<"After Dequeue -> highest priority: "<<pq[peekIndex()].value<<endl;
	return 0;
}