๋งž์™œํ‹€

[python] SWEA - 3347. ์˜ฌ๋ฆผํ”ฝ ์ข…๋ชฉ ํˆฌํ‘œ ๋ณธ๋ฌธ

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

๋ฐ˜์‘ํ˜•