title: Time Complexity of inserting string to c++ stl set
body: <p>What is the time complexity of inserting string to set container of c++ STL?
  According to me, it should be O(xlogn), where x is length of string to be inserted and n is size of set. Also copying of string to set should be of linear in length of string. 
  But this code of mine is running instantly.</p>
  
  <pre><code>#include&lt;bits/stdc++.h&gt;
  using namespace std;
  int main(){
  
      set&lt;string&gt; c;
      string s(100000,'a');
      for(int i=0;i&lt;100000;i++){
          c.insert(s);
      }
  
  }   
  </code></pre>
  
  <p>Where am I wrong, shouldn't the complexity be order of 10^10?</p>