main.cpp 1.1 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152
  1. #include <iostream>
  2. #include <queue> // priority_queue
  3. #include <utility> // pair
  4. #include <functional> // greater
  5. using namespace std;
  6. int main() {
  7. cout << "Hello containers !" << endl;
  8. cout << "# Priority queue" << endl;
  9. cout << "## With integers" << endl;
  10. priority_queue<int> pqInt;
  11. pqInt.push(5);
  12. pqInt.push(2);
  13. pqInt.push(0);
  14. pqInt.push(42);
  15. pqInt.push(3);
  16. while (!pqInt.empty()) {
  17. cout << pqInt.top() << " > ";
  18. pqInt.pop();
  19. }
  20. cout << endl;
  21. cout << "## With pairs" << endl;
  22. priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pqPair;
  23. pqPair.push(make_pair(4, 4));
  24. pqPair.push(make_pair(4, 5));
  25. pqPair.push(make_pair(5, 5));
  26. pqPair.push(make_pair(2, 5));
  27. pqPair.push(make_pair(0, 5));
  28. pqPair.push(make_pair(42, 5));
  29. pqPair.push(make_pair(3, 5));
  30. pqPair.push(make_pair(3, 5));
  31. pqPair.push(make_pair(3, 2));
  32. pqPair.push(make_pair(3, 0));
  33. pqPair.push(make_pair(3, 42));
  34. pqPair.push(make_pair(3, 3));
  35. while (!pqPair.empty()) {
  36. cout << pqPair.top().first << ';' << pqPair.top().second << " > ";
  37. pqPair.pop();
  38. }
  39. cout << endl;
  40. return 0;
  41. }