title: C++ set sorting with pair as key
body: <p>How will an ordered set container in c++ sort its keys if the key is a pair? (By default without a custom comparator)</p>
  
  <p>Say I have a key of (1,2) and another key of (1,1).</p>
  
  <p>Am I right to say that it will try to sort with respect to the first value in the pair then if they are equal proceed to compare the second pair value ? </p>
  
  <p>So in this scenario (1,1) will be before (1,2).</p>