/* HOSPITAL EMERGENCY CHALLENGE by ChillPill 2020 Coronavirus attacks your town. Luckily no one is dead(yet) but some are very badly sick and need medical care STAT. Some more lucky ones only have minor ailments. You work in emergency department of your hospital and must care for all these new patients arriving at the same time. First, you must register them all and assign them a priority number from 1 to 5 based on their severity (the code could just use random numbers) as well as an ID number. Priority 1 is extremely severe and requires immediate medical attention. Priority 5 is not severe and can wait forever (and keep whinning about how long they wait). We focus on saving lives All these patients are registered in a priority queue, so that everytime a bed becomes available, the bed goes to the next medically most needy person. To resume, the code should do following: -use priority queue -register 100 patients into the queue -pop patients out the priority queue, one by one and print their ID number and priority number*/ #include #include #include using namespace std; struct Patient{ int id; int priority; bool operator>(const Patient &other)const; }; bool Patient::operator>(const Patient &other)const{ if(priority==other.priority) return id>other.id; return priority>other.priority; } int main() { //priority queue is best because more patients can come in at anytime and heap sorting is best when entering new queued items. Pop is always const time O(1). Push is log(n) complexity, which is next best thing to constant time. priority_queue, greater>pq; for(int i=0;i<100;++i) pq.push({i,rand()%5+1}); while(!pq.empty()){ const Patient &pt=pq.top(); cout<

Priority Queue - Hospital Emergency