[백준] [Python] 1764번 듣보잡 - 정렬

www.acmicpc.net/problem/1764

1764번: 듣보잡

 

 Python

n, m = map(int, input().split())

heard = [input() for _ in range(n)]
seen = [input() for _ in range(m)]
heard.sort()
seen.sort()

h_idx = 0
s_idx = 0
result = []
cnt = 0
while h_idx<n and s_idx<m:
    if heard[h_idx] > seen[s_idx]:
        s_idx += 1
    elif heard[h_idx] < seen[s_idx]:
        h_idx += 1
    else:
        result.append(seen[s_idx])
        cnt+=1
        h_idx+=1
        s_idx+=1
        
print(cnt)
for i in range(len(result)):
    print(result[i])

 

 

 

merge sort와 유사한 방식