Priority_queue is the raw question of the priority queue HDU.

Priority queue: it can be used as a heap. For the type of the structure, you can find the first element of the queue.

Open Database: # include <queue>

Definition: priority_queue <type> q;

Type: int type priority <int> q; by default, Q. Top is the maximum value in the queue;

When we want to add other types in the queue, we need to define operator in struct;

The structure is as follows:

Defines <int> q. Top () as the minimum value;

Struct point

{

Int I;

Bool operator <(const point & A) const {

Return a. I <I;

}

}

Priority_queue <point> q;

 

Search for the first team: Q. Top ();

Check whether the queue is empty: Q. Empty ();

Q. Pop ();

Empty queue: While (! Q. Empty () Q. Pop ();

 

Priority_queue is the raw question of the priority queue HDU.