Приоритетная очередь

//pseudo
struct Student
{
     int mark;
     std::string name;
}
 
bool StudentsComparator(const Student& lhs, const Student& rhs)
{
      return lhs.mark > rhs.mark; //whatever
}
 
{
     std::priority_queue<Student, std::vector<Student>, StudentsComparator> queue;
 
}

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<queue>
#include<stdio.h>
#include<string>
using namespace std;
class student{
public:
    int mark;
    string name;
    student(int, string);
};
bool studentComparator(const student&k, const student&l)
{
    return k.mark > l.mark;
}
int main()
{
    priority_queue<student, vector<student>, student> pq;
    pq.push(student(5,"ivanov"));
    pq.push(student(3,"serov"));
    pq.push(student(4,"bobov"));
}

#include<iostream>
#include<queue>
#include<string>
#include <functional>
using namespace std;
class student{
    int mark;
    string name;
public:
    student(): mark(), name()
    {}
    student(int mk,const string& str): mark(mk), name(str)
    {}
    /**Для less*/
    friend bool operator<(const student& s1, const student& s2) {
        return s1.mark < s2.mark;
    }
    /**Для greater*/
    friend bool operator>(const student& s1, const student& s2) {
        return s1.mark > s2.mark;
    }
};
int main() {
    priority_queue<student, vector<student>, less<student> > pq;
    pq.push(student(5,"ivanov"));
    pq.push(student(3,"serov"));
    pq.push(student(4,"bobov"));
}