Algorithm Problem/Python
[python] SWEA - 3347. μ¬λ¦Όν½ μ’ λͺ© ν¬ν
deo2kim
2022. 3. 24. 22:50
λ°μν
π€λ¬Έμ ν΄κ²°
μ‘°μ§μμνμ μμ°μ κΈ°μ€μΌλ‘ μ¬λ°λ μ’ λͺ©μμ μ¬λ―Έμλ μ’ λͺ© μμλλ‘ νμ
μμ°μ λ³΄λ€ μ μ μ’ λͺ©μ μ°ΎμΌλ©΄ ν¬ννκ³ μ’ λ£
λͺ¨λ ν¬νκ° μ’ λ£λλ©΄ λνμκ° κ°μ₯ λμ μ’ λͺ©μ λ²νΈλ₯Ό μ°Ύλλ€.
π¨ SWEA λ λ¬Έμ λμ΄λλ₯Ό μ΄λ»κ²
π»μμ€ μ½λ
T = int(input())
for test_case in range(1, T + 1):
N, M = map(int, input().split())
events = list(map(int, input().strip().split()))
managers = list(map(int, input().strip().split()))
vote = [0] * N # ν¬ν μ
for manager in managers:
# μ¬λ°λ μ’
λͺ©(μ)μμ λΆν° μ°¨λ‘λ‘ μμ°λ³΄λ€ ν¬λ©΄ ν¬ν
for i, event in enumerate(events):
if event <= manager:
vote[i] += 1
break
answer = [0, 0] # [μΈλ±μ€, ν¬ν μ]
for i in range(N):
if vote[i] > answer[1]:
answer = [i + 1, vote[i]]
print(f'#{test_case} {answer[0]}')
πλ¬Έμ νμΈ
μΆμ²: SW Expert Academy
λ°μν