Submission #547848

#	Time	Username	Problem	Language	Result	Execution time	Memory
547848		beaconmc	Art Exhibition (JOI18_art)	Pypy 3	0 / 100	34 ms	18220 KiB

art

n = int(input())
paintings = []
for i in range(n):
    paintings.append(list(map(int, input().split())))
    
paintings.sort()

curmax = -1
curmin = float("inf")
cur = 0
ans = 0

for i in range(n):
    curmax = max(curmax, paintings[i][0])
    curmin = min(curmin, paintings[i][0])
    cur += paintings[i][1]
    ans = max(ans, cur-(curmax-curmin))
    print(cur-(curmax-curmin))
    if cur-(curmax-curmin)<0:
        curmax = -1
        curmax = max(curmax, paintings[i][0])
        curmin = min(curmin, paintings[i][0])
        cur = paintings[i][1]
for i in range(n):
    ans = max(ans, paintings[i][1])
print(ans)

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 50