알고리즘/구현

[백준]2875 대회or인턴

씩씩한 IT블로그 2020. 6. 17. 21:43
반응형

1. 내코드(통과)

import math
N,M,K=map(int,input().split())
# 여자가 남음
if N>=2*M:
    over=N-2*M
    isOverWo=True
# 남자가 남음
elif N<2*M:
    if N%2==0:
        over=M-N//2
    else:
        over=M-N//2+1
    M=N//2
    isOverWo=False

if over>=K:
    print(M)
else:
    K-=over
    needTeem=math.ceil(K/3)
    ans=M-needTeem
    if ans>=0:
        print(ans)
    else:
        print(0)

 

2. 숏코딩(통과)

n, m, k = map(int, input().split())
ans = 0
while n >= 2 and m >= 1 and n + m - 3 >= k:
    n -= 2
    m -= 1
    ans += 1

print(ans)
반응형