ARC074 D - 3N Numbers
提出
code: python
n = int(input())
a = list(map(int, input().split()))
for i in range(1, len(a)):
a_sum.append(a_sum-1 + ai) print(a_sum)
解答
code: python
import heapq
n = int(input())
a = list(map(int, input().split()))
former, latter = a:n, [-1 * i for i in a2*n:] # print(former, latter)
sum_former, sum_latter = sum(former), sum(latter)
heapq.heapify(former)
heapq.heapify(latter)
for i in range(n, 2*n):
p = heapq.heappushpop(former, v)
sum_former += v - p
resultsi-n+1 += sum_former for i in range(2*n-1, n-1, -1):
p = heapq.heappushpop(latter, v)
sum_latter += v - p
print(max(results))
テーマ
メモ