Submission #1050357

#TimeUsernameProblemLanguageResultExecution timeMemory
1050357vjudge1Art Exhibition (JOI18_art)Cpython 3
30 / 100
1020 ms3668 KiB
def maximize_exhibition_value(N, artworks): # Sort artworks by their size A artworks.sort() max_value = float('-inf') for i in range(N): current_sum = 0 A_min = artworks[i][0] for j in range(i, N): current_sum += artworks[j][1] A_max = artworks[j][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)
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...