Download

#include 
#include 

int main ()
{
    using namespace std;

    priority_queue  pqIntegers;
	for(int i=0; i<10;i++)
		pqIntegers.push (rand() % 100);

    cout << "'priority_queue' contient " << pqIntegers.size () << " élément(s)";
    cout << endl;
    cout << "retourner le plus grand élément de la 'priority_queue': "
		 << pqIntegers.top () << endl << endl;

   cout << "supprimer le plus grand élément de la 'priority_queue' n";

   pqIntegers.pop ();

   cout << "Maintenant le plus grand élément de la 'priority_queue'= "
		 << pqIntegers.top () << endl << endl;

    return 0;
}