Multiple Comparisons in a C++ Priority Queue
Next, we are going to make multiple comparisons using the priority queue on a user-defined data type and then we are going to sort the data that has been given to us.
We can build a comparator function that compares more than one parameter and sort the data structure based on the conditions provided in the comparator. Below is an implementation of multiple comparisons in C++ priority queue.
C++
#include <bits/stdc++.h>using namespace std;// Structure of a user defined data structurestruct jobs {public: int priority; int processing; int arrivaltime; int proccessing_time; string job; jobs(int priority1, int processing1, int arrivaltime1, int proccessing_time1, string s1) { this->priority = priority1; this->processing = processing1; this->arrivaltime = arrivaltime1; this->proccessing_time = proccessing_time1; this->job = s1; }};// Here we are sorting based on the processing time// if the priority is same and we are sorting// in descending order if the priority is same.// Else we are sorting in ascending order// on the priority of the tasks given to usstruct compare { bool operator()(jobs a, jobs b) { if (a.priority == b.priority) { return a.processing < b.processing; } return a.priority > b.priority; }};// Driver codeint main(){ priority_queue<jobs, vector<jobs>, compare> pq; for (int i = 0; i < 10; i++) { jobs a(rand() % 11, i + 1, rand() % 3 + i, rand() % 5 + 3, "somejob" + to_string(i)); pq.push(a); } while (pq.empty() == false) { jobs b = pq.top(); pq.pop(); cout << b.priority << " " << b.processing << " " << b.arrivaltime << " " << b.proccessing_time << " " << b.job << endl; } return 0;} |
Output
0 9 10 5 somejob8 0 8 7 6 somejob7 3 3 2 4 somejob2 4 2 3 3 somejob1 6 1 1 6 somejob0 7 5 5 3 somejob4 7 4 5 4 somejob3 10 10 10 6 somejob9 10 7 7 5 somejob6 10 6 5 4 somejob5