Submission #1050197

#TimeUsernameProblemLanguageResultExecution timeMemory
1050197vjudge1Art Exhibition (JOI18_art)Cpython 3
30 / 100
1077 ms3932 KiB
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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...