제출 #1231745

#제출 시각아이디문제언어결과실행 시간메모리
1231745durdonaTable Tennis (info1cup20_tabletennis)Pypy 3
20 / 100
3106 ms291300 KiB
from itertools import combinations as comb
def fun(arr):
    arr.sort()
    n=len(arr)
    hozir=arr[0]+arr[-1]
    for i in range(n//2):
        if arr[i]+arr[n-i-1]!=hozir:
            return False
    return True
n,k=map(int,input().split())
arr=list(map(int,input().split()))
for c in comb(range(n+k),k):
    c=set(c)
    t=[arr[i] for i in range(n+k) if i not in c]
    if fun(t):
        print(*t)
        break

    

컴파일 시 표준 출력 (stdout) 메시지

Compiling 'tabletennis.py'...

=======
  adding: __main__.pyc (deflated 34%)

=======
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...