![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1656481599887-Article.jpg\")
<\/p>\n<\/p>\n
Priority queue is an abstract data type, It is a type of queue in which each element has a priority assigned to it. The priority of the element determines the order in which elements are removed from the priority queue. In the priority queue, all the elements are arranged either in ascending order or descending order.<\/p>\n
Basically priority queue designed in such a way that the greatest or smallest element is placed on the top of the queue. however, The below example of priority queue gives us error as priority_queue doesn\u2019t know in what order (max or min) we need to arrange the objects.<\/p>\n Defining priority queue:<\/strong><\/p>\n To rectify the above error we\u2019ll use operator overloading<\/strong> to define the priority, so that priority_queue can decide how to store the objects.<\/p>\n Operators are used to work for user-defined classes i.e. C++ has the ability to provide the operators with a special meaning for a data type, this is known as operator overloading. Operator overloading is a compile time polymorphism in OOPs.<\/p>\n For example:<\/em><\/strong><\/p>\n In the above example, \u201ca\u201d and \u201cb\u201d are the variables of int and float data type, which are built in data types. Hence the addition operator \u201c+\u201d can easily add the contents of variable \u201ca\u201d and \u201cb\u201d. This is because the addition operator \u201c+\u201d is predefined to add variables of pre-defined data types only.<\/p>\n
\nIn STL, the top element of the priority queue is always the greater element. Also, we can change it to the smallest element of the queue.
\nBy default, priority queue is a max-heap.
\nSo basically in this article we\u2019ll study how we can use priority queue for data types like class and structure.
\nFor example, we have a structure named student which consists of two variables Rollno<\/strong> and Address<\/strong> and we want to store them in priority queue.<\/p>\n struct student{\n int Rollno;\n float Address;\n }<\/code><\/pre>\n priority_queueNow, what is operator overloading?<\/h3>\n
int a;\nfloat b,add;\nadd = a + b;<\/code><\/pre>\nImplementation of priority_queue using structure:<\/h4>\n\t\t\t\t\t\t