| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1285853 | Joon_Yorigami | Art Exhibition (JOI18_art) | Pypy 3 | 1102 ms | 123500 KiB |
import io,os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
n=int(input())
pairs=[]
pref=[0]
ans=0
for _ in'1'*n:
a,b=map(int,input().split())
ans=max(ans,b)
pairs.append([a,b])
pairs.sort()
for a,b in pairs:
pref.append(pref[-1]+b)
maxi=pairs[0][0]
for i in range(n):
ans=max(ans,pref[i+1]-pairs[i][0]+maxi)
maxi=max(maxi,pairs[i][0]-pref[i])
print(ans)
Compilation message (stdout)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
