Submission #547853

#TimeUsernameProblemLanguageResultExecution timeMemory
547853beaconmcArt Exhibition (JOI18_art)Pypy 3
0 / 100
38 ms18220 KiB
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] if cur-(curmax-curmin)<cur: curmax = paintings[i][0] curmin = paintings[i][0] cur = paintings[i][1] ans = max(ans, cur-(curmax-curmin)) print(ans)
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...