gistfile1.txt

# [2015-06-01] Challenge #217 [Easy] Lumberjack Pile Problem
# http://www.reddit.com/r/dailyprogrammer/comments/3840rp/20150601_challenge_217_easy_lumberjack_pile/

n, to_place, *piles = [int(n) for n in open("input.txt").read().split()]

print(len(piles))

def get_smallest(piles):
    smallest, second = piles[0], piles[0]
    for i, pile in enumerate(piles):
        if pile < smallest:
            index = i
            second = smallest
            smallest = pile
    return index, second-smallest

while to_place > 0:
    index, difference = get_smallest(piles)

    difference = min(to_place, difference)
    difference = max(difference, 1)
    piles[index] += difference
    to_place -= difference

#for i in range(0, n*n, n):
#    print(*piles[i:i+n])

print(min(piles))