Submission #56264187

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
n, m = map(int, input().split())
a = list(map(int, input().split())) #len(a)==n
def is_possible(x, a, m):
    total = 0
    for ai in a:
        total += min(x, ai)
        if total > m:
            return False
    return True
def find_maximum_x(n, m, a):
    left, right = 0, max(a)
    best_x = 0
    
    while left <= right:
        mid = (left + right) // 2
        if is_possible(mid, a, m):
            best_x = mid
            left = mid + 1
        else:
            right = mid - 1
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

n, m = map(int, input().split())
a = list(map(int, input().split())) #len(a)==n
def is_possible(x, a, m):
    total = 0
    for ai in a:
        total += min(x, ai)
        if total > m:
            return False
    return True

def find_maximum_x(n, m, a):
    left, right = 0, max(a)
    best_x = 0
    
    while left <= right:
        mid = (left + right) // 2
        if is_possible(mid, a, m):
            best_x = mid
            left = mid + 1
        else:
            right = mid - 1
    
    return best_x

result = find_maximum_x(n, m, a)
if result == max(a):
    result = 'infinite'
print(result)

Submission Info

Judge Result