This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
n=int(input())
mas=[]
for i in range(n):
mas.append(list(map(int,input().split())))
mas.sort(key=lambda x:x[0])
maxi=0
for i in range(n):
mx=0
mn=10**15+7
sm=0
for j in range(i,n):
mx=max(mas[j][0],mx)
mn=min(mas[j][0],mn)
sm+=mas[j][1]
maxi=max(maxi,sm-mx+mn)
print(maxi)
# | 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... |