Experiment with queues and pairs

containers/main.cpp

@@ -1,5 +1,6 @@
 #include <iostream>
 #include <queue>
+#include <utility>
 
 using namespace std;
 
@@ -23,5 +24,28 @@ int main() {
 	}
 	cout << endl;
 
+	cout << "## With pairs" << endl;
+
+	priority_queue<pair<int, int>> pqPair;
+
+	pqPair.push(make_pair(4, 4));
+	pqPair.push(make_pair(4, 5));
+	pqPair.push(make_pair(5, 5));
+	pqPair.push(make_pair(2, 5));
+	pqPair.push(make_pair(0, 5));
+	pqPair.push(make_pair(42, 5));
+	pqPair.push(make_pair(3, 5));
+	pqPair.push(make_pair(3, 5));
+	pqPair.push(make_pair(3, 2));
+	pqPair.push(make_pair(3, 0));
+	pqPair.push(make_pair(3, 42));
+	pqPair.push(make_pair(3, 3));
+
+	while (!pqPair.empty()) {
+		cout << pqPair.top().first << ';' << pqPair.top().second << " > ";
+		pqPair.pop();
+	}
+	cout << endl;
+
 	return 0;
 }