unordered_map c++ insert

// C++ program to illustrate 
// unordered_map::insert({key, element}) 
#include <bits/stdc++.h> 
using namespace std; 
  
int main() 
{ 
    // initialize container 
    unordered_map<int, int> ump; 
  
    // insert elements in random order 
    ump.insert({ 20, 130 }); 
    ump.insert({ 100, 410 }); 
    ump.insert({ 31, 60 }); 
  
    // prints the elements 
    cout << "KEY\tELEMENT\n"; 
    for (auto itr = ump.begin(); itr != ump.end(); itr++) { 
        cout << itr->first 
             << '\t' << itr->second << '\n'; 
    } 
    return 0; 
}