Priority queue for user-defined types

Question

I have the below struct

struct node{
   float val;
   int count;

}

I have several objects of this struct. Now, I want to insert these objects into a priority queue of STL such that the priority queue orders the items by count. Any idea on how to do so? Preferably a min heap is preferred. I know how to do the above for primitive data types, not structs

Answer 1

Overload the < operator:

bool operator<(const node& a, const node& b) {
  return a.count > b.count;
}

I have reversed the comparison to achieve min heap wihtout passing extra arguments to the priority queue. Now you use it like this:

priority_queue<node> pq;
...

Edit: take a look at this post which seems to be almost exact duplicate: STL Priority Queue on custom class

Answer 2

#include <iostream>
#include <queue>
#include <vector>
using namespace std;
class Boxer{
    public:
        string name;
        int strength;
};
struct Comp{
    bool operator()(const Boxer& a, const Boxer& b){
        return a.strength<b.strength;
    }
};
int main(){
    Boxer boxer[3];
    boxer[0].name="uday", boxer[0].strength=23;
    boxer[1].name="manoj", boxer[1].strength=33;
    boxer[2].name="rajiv", boxer[2].strength=53;

    priority_queue< Boxer, vector<Boxer>, Comp> pq;
    pq.push(boxer[0]);
    pq.push(boxer[1]);
    pq.push(boxer[2]);
    Boxer b = pq.top();
    cout<<b.name;
    //result is Rajiv

    return 0;
}