ABC172 C - Tsundoku

提出

WA

code: python

import bisect

n, m, k = map(int, input().split())

a = list(map(int, input().split()))

b = list(map(int, input().split()))

# できない

# for i in range(200000):

# for j in range(200000):

# print(i, j)

for i in range(1, n):

for i in range(1, m):

ans = float('inf')

# a固定、b二分探索

for i in range(n):

if (rest < 0):

continue

b_index = bisect.bisect_left(b_sum, rest)

print(b_index)

res = (i+1) + b_index

if (res < ans):

ans = res

print(ans)

解答

code: python

n, m, k = map(int, input().split())

a = list(map(int, input().split()))

b = list(map(int, input().split()))

for i in range(n):

for i in range(m):

ans = 0

# bを全部読む

j = m

for i in range(n + 1):

# aのみでさえ読めなかったら終わり

break

# 1冊ずつ諦めていく

j -= 1

res = i + j

if (res > ans):

ans = res

print(ans)

テーマ