Vectors as Inputs to Map, C++ (gcc)

Language: Layout:

//Title of this code
// Vectors as Inputs for Map Containers

#include <iostream>
#include <map>
#include <vector>
#include <cstdlib>

using namespace std;

typedef vector<double>Value;
typedef vector<int>Key;
typedef map<Key::value_type, Value::value_type, less<Key::value_type> >TMap;

template<class T>ostream& operator <<(ostream& out, const vector<T>& v){
    for(auto i:v)
        out << i << "  ";
    return out;
};

int main()
    
{
    int vkSize = 10;
        
    Key key(vkSize);
    Value value(vkSize); 
    TMap map1; 
    
    double d = 1.0;
    int j = 1;
    
    pair<Key::value_type, Value::value_type>p(key[0], value[0]); // declare and initialize p
    
    srand(1);
    for(int i = 0; i<vkSize; i++){
        double f = rand() % 100 + 1.25;
        d = f/100.0;
        
        value[i] = d; // fill value vector
        key[i] = j;   // fill key vector
        
        p = make_pair(key[i], value[i]);        
        map1.insert(p); // fill map
                      
        j++;             
    }
    
    cout << "Keys:\t[" << key << "]\n";
    cout << "Values:\t[" << value << "]\n\n";
    
    TMap::const_iterator cIt1;
    
    cout << "Key\tValue\n\n";
    for(int i = 1; i < (vkSize+1); i++){
        cIt1 = map1.find(i);
        cout << cIt1->first << "\t" << cIt1->second << "\n";
    }
    
    
    return 0;
}

Show compiler warnings [ + ] Compiler args [ + ] Show input
Compilation time: 0.62 sec, absolute running time: 0.04 sec, cpu time: 0 sec, memory peak: 3 Mb, absolute service time: 0.66 sec