| 
์ฝ๋ ์์ฑํ๊ธฐ
์ฝ๋ ์์ฑํ๊ธฐfrom collections import deque
def solution (A, B):
A = sorted(A, reverse=True)
B = deque(sorted(B, reverse=True))
print(sorted(B))
answer = 0
for i in range(len(A)):
if A[i] >= B[0]:
B.pop()
else:
B.popleft()
answer += 1
return answer
Python
๋ณต์ฌ
| ์ฝ๋ ์ค๋ช
ํ๊ธฐ
์ฝ๋ ์ค๋ช
ํ๊ธฐ๋ ๋ค ์์๋๋ก ์ ๋ ฌ ํ ๊ฐ์ฅ ํฐ ์๋ฅผ ๋๋ณด๊ณ ์ ๋๋ฉด ๊ฐ์ฅ ์์ ์ ๋ฃ๊ธฐ
