PriorQ2, C++ (gcc)

Language: Layout:

//g++  7.4.0
//////////////////////////////////////////////////////////////////////////////
//PriorQ2
//operator() overloading credit goes to geeksfor geeks.com;rest of the code is created by Rezaul Hoque on July 08,2022;
//contact:jewelmrh@yahoo.com;Dhaka,Bangladesh;https://rezaulhoque.wordpress.com,https://hoquestake.blogspot.com
//note: codes shared by Rezaul Hoque on rextester are not for sale; they are created and shared to facilitate the algorithm learning process; many like Hoque use this platform to practice programming ;Rezaul hopes his contribution helps others to fine tune their learning;
/////////////////////////////////////////////////////////////////////////////

#include <iostream>
#include <queue>
#include <string>
#include <vector>
class DePQ{

std::string city;

public:
int rank;
DePQ(){}
DePQ(std::string s,int r){city =s; rank=r;}
DePQ(const DePQ& c){ city=c.city; rank=c.rank;}
~DePQ(){}

std::string getC(){return city;}
int getR(){return rank;}
};
bool operator<(const DePQ& q1,const DePQ& q2)
{
return q1.rank<q2.rank;
}
int main()
{
std::priority_queue<DePQ>  p;

p.push(DePQ("Rome",2));
p.push(DePQ("Sparta ",1));
p.push(DePQ("Athens", 3));

while (p.empty()==false)
{
DePQ q=p.top();
p.pop();
std::cout<<q.getC()<<" "<<q.getR()<<"\n";
}

return 0;
}

Show compiler warnings [ + ] Compiler args [ + ] Show input
Compilation time: 0.83 sec, absolute running time: 0.18 sec, cpu time: 0.01 sec, memory peak: 5 Mb, absolute service time: 1,1 sec