[알고리즘] 백준 17224 APC는 왜 서브태스크 대회가 되었을까? / python

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

17224번: APC는 왜 서브태스크 대회가 되었을까?

 

N, L, K = map(int, input().split())
problem = [[0]*2 for _ in range(N)]

for i in range(N):
        problem[i] = list(map(int, input().split()))

count, num = 0, 0

for i in range(N):
    if problem[i][1] <= L and num < K:
        count += 140
        num += 1
for j in range(N):
    if problem[j][0] <= L and problem[j][1] > L and num < K:
        count += 100
        num += 1

print(count)

 

N, L, K = map(int, input(),split())

easy, hard = 0, 0

for i in range(N):
    sub1, sub2 = map(int, input().split())
    if sub2 <= L:
        hard += 1
    elif sub1 <= L:
        easy += 1

ans = min(hard, K) * 140
if hard < K:
    ans = min(K-hard, easy) * 100

print(ans)