제출 #1112021

#제출 시각아이디문제언어결과실행 시간메모리
1112021vjudge1Art Exhibition (JOI18_art)Cpython 3
10 / 100
1067 ms2980 KiB
from itertools import combinations as c N=int(input()) a=[list(map(int,input().split()))for _ in range(N)] print(max(sum(x[1] for x in s)-(max(x[0] for x in s)-min(x[0] for x in s)) for r in range(1,N+1) for s in c(a,r))) # Brute force T-T
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...