title: map of vectors in STL?
body: <p>I want to have a map of vectors, (but I don't want to use pointer for the internal vector), is it possible?</p>
  
  <pre><code>// define my map of vector
  map&lt;int, vector&lt;MyClass&gt; &gt; map;
  
  // insert an empty vector for key 10. # Compile Error
  map.insert(pair&lt;int, vector&lt;MyClass&gt; &gt;(10, vector&lt;MyClass&gt;)); 
  </code></pre>
  
  <p>I know that if I have used pointer for vector, as follows, it would be fine, but I wonder if I can avoid using pointer and use the above data structure (I don't want to manually delete)</p>
  
  <pre><code>// define my map of vector
  map&lt;int, vector&lt;MyClass&gt;* &gt; map;
  
  // insert an empty vector for key 10.
  map.insert(pair&lt;int, vector&lt;MyClass&gt;* &gt;(10, new vector&lt;MyClass&gt;)); 
  </code></pre>