// CPP program to demonstrate working of map
#include <bits/stdc++.h>
using namespace std;
 
int main()
{
	map<int, int> m;
 
	m[1] = 2; // Insertion by indexing
    m[2] = 3;
    m[2] = 3;
	// Direct pair insertion
	m.insert({ 4, 5 });
		m.insert({ 4, 7 });
 
	// Insertion of pair by make_pair
	m.insert(make_pair(8, 5));
 
	cout << "Elements in map:\n";
	for (auto it : m)
		cout << "[ " << it.first << ", "
			<< it.second << "]\n"; // Sorted
 
	return 0;
}
 

Ly8gQ1BQIHByb2dyYW0gdG8gZGVtb25zdHJhdGUgd29ya2luZyBvZiBtYXAKI2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpCnsKCW1hcDxpbnQsIGludD4gbTsKCgltWzFdID0gMjsgLy8gSW5zZXJ0aW9uIGJ5IGluZGV4aW5nCiAgICBtWzJdID0gMzsKICAgIG1bMl0gPSAzOwoJLy8gRGlyZWN0IHBhaXIgaW5zZXJ0aW9uCgltLmluc2VydCh7IDQsIDUgfSk7CgkJbS5pbnNlcnQoeyA0LCA3IH0pOwoKCS8vIEluc2VydGlvbiBvZiBwYWlyIGJ5IG1ha2VfcGFpcgoJbS5pbnNlcnQobWFrZV9wYWlyKDgsIDUpKTsKCgljb3V0IDw8ICJFbGVtZW50cyBpbiBtYXA6XG4iOwoJZm9yIChhdXRvIGl0IDogbSkKCQljb3V0IDw8ICJbICIgPDwgaXQuZmlyc3QgPDwgIiwgIgoJCQk8PCBpdC5zZWNvbmQgPDwgIl1cbiI7IC8vIFNvcnRlZAoKCXJldHVybiAwOwp9Cg==