๋ณธ๋ฌธ์œผ๋กœ ๋ฐ”๋กœ๊ฐ€๊ธฐ

๋ฐฑ์ค€ ๋ฉ์น˜

category ๐Ÿ Python/๐Ÿ“ CodingTest 2021. 9. 23. 10:56

https://www.acmicpc.net/problem/7568

 

7568๋ฒˆ: ๋ฉ์น˜

์šฐ๋ฆฌ๋Š” ์‚ฌ๋žŒ์˜ ๋ฉ์น˜๋ฅผ ํ‚ค์™€ ๋ชธ๋ฌด๊ฒŒ, ์ด ๋‘ ๊ฐœ์˜ ๊ฐ’์œผ๋กœ ํ‘œํ˜„ํ•˜์—ฌ ๊ทธ ๋“ฑ์ˆ˜๋ฅผ ๋งค๊ฒจ๋ณด๋ ค๊ณ  ํ•œ๋‹ค. ์–ด๋–ค ์‚ฌ๋žŒ์˜ ๋ชธ๋ฌด๊ฒŒ๊ฐ€ x kg์ด๊ณ  ํ‚ค๊ฐ€ y cm๋ผ๋ฉด ์ด ์‚ฌ๋žŒ์˜ ๋ฉ์น˜๋Š” (x, y)๋กœ ํ‘œ์‹œ๋œ๋‹ค. ๋‘ ์‚ฌ๋žŒ A ์™€ B์˜ ๋ฉ

www.acmicpc.net

N = int(input())

li = []

for i in range(N):
    li.append(list(map(int, input().split())))

for i in range(N):
    rank = 1
    for j in range(N):
        if (li[i][0]<li[j][0] and li[i][1]<li[j][1]):
            rank+=1
    print(rank, end=' ')

1. ํ–‡๊ฐˆ๋ฆฌ๋Š” map(int, input(),split()) ๋ณต์Šต

2. map๊ฐ์ฒด๋ฅผ list๋กœ ๋ณ€ํ™˜์‹œ์ผœ์„œ ๋‹ค์‹œ li๋กœ appendํ•˜์—ฌ 2์ฐจ์› ๋ฐฐ์—ด๋กœ ๋งŒ๋“ฌ

3. brute force algorithm์„ ํ™œ์šฉํ•œ ๋น„๊ต 

๋ฐ˜์‘ํ˜•