main.cpp 1005 B

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