[백준 문제풀이] 얼렁뚱땅 2304 창고 다각형 풀이

https://www.acmicpc.net/problem/2304

2304번: 창고 다각형

 

n = int(input())
arr = [list(map(int,input().split())) for _ in range(n)]
arr.sort(key=lambda x:x[0])

wow = list(list(zip(*arr))[1])
max_ = max(wow)
max_idx = wow.index(max_)

left = arr[:max_idx]
right = arr[max_idx+1:]

sum_ = 0


if left :
    high = left[0][1]
    last_thing = left[0][0]
    for i in range(len(left)) :
        if high < left[i][1] :
            sum_ += (left[i][0] - last_thing) * high
            high = left[i][1] 
            last_thing = left[i][0]

    sum_ += ((arr[max_idx][0]-last_thing) * high)

if right : 
    high = right[-1][1]
    last_thing = right[-1][0]
    for i in range(len(right)-1,-1,-1) :
        if high <= right[i][1] :
            sum_ += (last_thing-right[i][0]) * high
            high = right[i][1] 
            last_thing = right[i][0]

    sum_ += ((last_thing - arr[max_idx][0]) * high)


sum_ += max_

print(sum_)