Submission #3007192

---

Source Code Expand

N, C = map(int, input().split())
sushi = [[int(x) for x in input().split()] for _ in range(N)]

ans = 0
for i in range(N + 1):
    # OA
    if i == 0:
        oa_x = 0
        oa_v = 0
    else:
        oa_x = sushi[i - 1][0]
        oa_v = sum([sushi[ii][1] for ii in range(i)])

    for j in range(N + 1):
        # OB
        if j == 0:
            ob_x = 0
            ob_v = 0
        else:
            ob_x = C - sushi[j - 1][0]
            ob_v = sum([sushi[jj][1] for jj in range(N - 1, j - 2, -1)])

        v = oa_v + ob_v

        # 2OA + OB
        x = 2 * oa_x + ob_x
        if x < C:
            ans = max(ans, v - x)

         # OA + 2OB
        x = oa_x + 2 * ob_x
        if x < C:
            ans = max(ans, v - x)
print(ans)

Submission Info

Judge Result