oj.uz

Submission #698185

# Submission time Handle Problem Language Result Execution time Memory
698185 2023-02-12T19:06:52 Z zzzzzzzzzzzzzzz Art Exhibition (JOI18_art) Python 3
0 / 100
 13 ms 2772 KB 
n=int(input())
li=[[*map(int,input().split())]for _ in range(n)]
li.sort(key=lambda x:x[0])
li2=[]
for i in range(n):
  if(i==0):li2.append(li[i][1])
  else:li2.append(li[i][1]-(li[i][0]-li[i-1][0]))
s=[li2[0]]
for i in range(n-1):
    s.append(max(s[i]+li2[i+1],li2[i+1]))
print(max(s))

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 2772 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 2772 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 2772 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 2772 KB Output isn't correct
2 Halted 0 ms 0 KB -