oj.uz

답안 #547850

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
547850 2022-04-11T21:40:22 Z beaconmc Art Exhibition (JOI18_art) PyPy 3
0 / 100
 37 ms 18228 KB 
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]
    ans = max(ans, cur-(curmax-curmin))
    if cur-(curmax-curmin)<0:
        curmax = paintings[i][0]
        curmin = paintings[i][0]
        cur = paintings[i][1]
for i in range(n):
    ans = max(ans, paintings[i][1])
print(ans)

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 18220 KB Output is correct
2 Correct 37 ms 18164 KB Output is correct
3 Correct 34 ms 18228 KB Output is correct
4 Incorrect 36 ms 18188 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 18220 KB Output is correct
2 Correct 37 ms 18164 KB Output is correct
3 Correct 34 ms 18228 KB Output is correct
4 Incorrect 36 ms 18188 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 18220 KB Output is correct
2 Correct 37 ms 18164 KB Output is correct
3 Correct 34 ms 18228 KB Output is correct
4 Incorrect 36 ms 18188 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 18220 KB Output is correct
2 Correct 37 ms 18164 KB Output is correct
3 Correct 34 ms 18228 KB Output is correct
4 Incorrect 36 ms 18188 KB Output isn't correct
5 Halted 0 ms 0 KB -