Given two sequences of integers, count the minimum number of swaps (A[k], B[k]) needed to make both sequences increasing.
  
  
  Stats:
  
    
      2751 started
    
    
      3 silver awards
    
    
      79 golden awards
    
  
  Hall of fame:
  
    
      
        
          
            
            
              
              
                1
              
             
           
          Peng Cao
          
        
 
        
          Time: 7 minutes
        
       
    
      
        
          
            
            
              
              
                2
              
             
           
          Xiaojun Liu
          
        
 
        
          Time: 19 minutes
        
       
    
      
        
          
            
            
              
              
                3
              
             
           
          Grzegorz Owsiany
          
        
 
        
          Time: 46 minutes