Using a different comparison function: greater : Priority Queue « Data Structure « C++

Home C++ 1. Bitset 2. Class 3. Console 4. Data Structure 5. Data Type 6. Deque 7. Development 8. File 9. Function 10. Generic 11. Language 12. List 13. Map Multimap 14. Overload 15. Pointer 16. Qt 17. Queue Stack 18. Set Multiset 19. STL Algorithms Binary search 20. STL Algorithms Heap 21. STL Algorithms Helper 22. STL Algorithms Iterator 23. STL Algorithms Merge 24. STL Algorithms Min Max 25. STL Algorithms Modifying sequence operations 26. STL Algorithms Non modifying sequence operations 27. STL Algorithms Sorting 28. STL Basics 29. String 30. Valarray 31. Vector C / ANSI-C C Tutorial C++ Tutorial Visual C++ .NET

C++ » Data Structure » Priority Queue Screenshots  Using a different comparison function: greater #include <iostream> #include <queue> #include <functional> using namespace std; int main() {   priority_queue<int, vector<int>, greater<int> > q;      q.push(1);   q.push(3);   q.push(4);   while(!q.empty()) {     cout << "Popping ";     cout << q.top() << endl;     q.pop();   }   return 0; }                     Related examples in the same category 1. Demonstrate a priority_queue. 2. Storing class objects in a priority_queue. 3. PriorityQueue: push, pop and top