Priority queues.

See version :

Pas de dépendances

Download :

#include <queue>
#include <iostream>

using namespace std;

int main()
{
    priority_queue<int> q;

    q.push(5);
    q.push(13);
    q.push(8);
    q.push(6);

    cout << "lecture de la file de priotite" << endl;
    while(!q.empty())
    {
        cout << q.top() << endl;
        q.pop();
    }
    return 0;
}

	No explanations yet.