Level1 체육복

def solution(n, lost, reserve):
    answer = 0; cnt=0
    
    k = len(lost)
    
    lost.sort()
    reserve.sort()
    
    for i in range(k):
        now = lost[i]
        left = lost[i]-1
        right = lost[i]+1
        
        if(reserve.count(now)==1): kk=1    
        elif(reserve.count(left)==1 and reserve.count(now)!=1 and lost.count(left)!=1): 
            #if(lost.count(left)!=1)
            index = reserve.index(left)
            del reserve[index]
        elif(reserve.count(right)==1 and  reserve.count(now)!=1 and lost.count(right)!=1): 
            index = reserve.index(right)
            del reserve[index]  
        else: cnt+=1    
            
    return n-cnt