제출 #547478

#제출 시각아이디문제언어결과실행 시간메모리
547478beaconmcStove (JOI18_stove)Cpython 3
100 / 100
219 ms12100 KiB
I=input H=int F=range B,G=map(H,I().split()) D=[] for A in F(B):D.append(H(I())) C=[] for A in F(1,B):C.append(D[A]-D[A-1]) C=sorted(C) E=0 for A in F(B-G):E+=C[A]-1 print(E+B)
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...