#include <iostream>
     #include <cstdlib>
     #include <queue>
     using namespace std;
     
     int main()
     {
         //priority_queue <int> pq;  // default BIGGER PRIORITY processed first
         //priority_queue <int, vector<int>, less <int> > pq; // same as above - BIGGER
         priority_queue <int, vector<int>, greater <int> > pq; // SMALLER Priority processed first

         for (int i = 0; i < 10; i++)
            pq.push(i);
     
         while (!pq.empty())
         {
               cout << pq.top() << endl;
               pq.pop();
         }
     
     
         system("Pause");
         return EXIT_SUCCESS;
     }