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())
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 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... |