제출 #633065

#제출 시각아이디문제언어결과실행 시간메모리
633065karolb2011Potatoes and fertilizers (LMIO19_bulves)Cpython 3
24 / 100
833 ms26792 KiB
import sys import heapq as hq input = sys.stdin.readline n=int(input()) t=0 p=0 s=[] ww=0 z=[] for i in range(n): pi,bi=list(map(int,input().split())) p+=pi-bi s.append(p) if p==0: for c in s: ww+=abs(c) elif p==1: for c in s: if c>=1: w+=c t+=c-1 else: w-=c t-=c-1 z.append(w-t) print(min(t,min(z)+t)) else: w=[] for c in s: if c<0: ww-=c c=0 elif c>p: ww+=c-p c=p hq.heappush(w,-c) if w[0]<-c: hq.heappush(w,-c) ww+=abs(-hq.heappop(w)-c) print(ww)
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...