제출 #1050369

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1050369		vjudge1	Art Exhibition (JOI18_art)	Cpython 3	0 / 100	15 ms	2912 KiB

art

def maximize_exhibition_value(N, artworks):
    # Sort artworks by their size A
    artworks.sort()

    max_value = float('-inf')
    current_sum = 0
    left = 0

    for right in range(N):
        current_sum += artworks[right][1]

        # Get current Amax and Amin
        A_max = artworks[right][0]
        A_min = artworks[left][0]

        # Calculate current value
        current_value = current_sum - (A_max - A_min)
        max_value = max(max_value, current_value)

        # Adjust the left pointer to try minimizing Amax - Amin
        while A_max - A_min > 0 and left < right:
            current_sum -= artworks[left][1]
            left += 1
            A_min = artworks[left][0]
            current_value = current_sum - (A_max - A_min)
            max_value = max(max_value, current_value)

    return max_value

# Input reading
N = int(input().strip())
artworks = []
for _ in range(N):
    A, B = map(int, input().strip().split())
    artworks.append((A, B))

# Calculate and print the result
result = maximize_exhibition_value(N, artworks)
print(result)

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 50