[BOJ] 18111 | 마인크래프트

18111 | 마인크래프트
https://www.acmicpc.net/problem/18111

 

 

 

 

작성 코드

 

import sys
n, m, b = map(int, sys.stdin.readline().split())

mine = []

for _ in range(n):
    mine += map(int, sys.stdin.readline().split()) 

times = []
mine_maxs = []

mine_max = max(mine)

for _ in range(256):
    time = 0
    need = 0
    over = 0
    for i in mine:
        if mine_max > i:
            need += mine_max - i
        elif mine_max < i:
            over += i - mine_max

    if need > over + b:
        mine_max -= 1

    else:
        time += 2*over + need

        times.append(time)
        mine_maxs.append(mine_max)
        mine_max -= 1

        

print(min(times), mine_maxs[times.index(min(times))] )