๐Ÿ—๏ธ Algorithm/๐ŸŸฉ ๋ฐฑ์ค€

[๋ฐฑ์ค€] [Python] 7568๋ฒˆ_๋ฉ์น˜

Dbswnstjd 2022. 3. 18. 19:09

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

 

7568๋ฒˆ: ๋ฉ์น˜

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

www.acmicpc.net

ํ’€์ด

# ๋ฐฑ์ค€ 7568๋ฒˆ ๋ฌธ์ œ - ๋ฉ์น˜
n = int(input())
info = []
for i in range(n):
    w, h = map(int, input().split())
    info.append((w,h))
for i in info:
    rank = 1
    for j in info:
        if i[0] < j[0] and i[1] < j[1]:
            rank += 1
    print(rank, end= ' ')

์™„์ „ํƒ์ƒ‰์„ ํ†ตํ•ด ๋ชธ๋ฌด๊ฒŒ์™€ ํ‚ค๊ฐ€ ํฌ๋‹ค๋ฉด ์ˆœ์œ„๋ฅผ ๋”ํ•ด์ค€๋‹ค.