제출 #1232110

#제출 시각아이디문제언어결과실행 시간메모리
1232110durdonaTable Tennis (info1cup20_tabletennis)Pypy 3
49 / 100
3098 ms155236 KiB
import random
n,k=map(int,input().split())
arr=list(map(int,input().split()))
arr.sort()
while True:
        i,j=random.randint(0,n+k-1),random.randint(0,n+k-1)
        s=arr[i]+arr[j]
        ja=[]
        l,r=0,n+k-1
        while l<r and len(ja)<n:
            if arr[l]+arr[r]<s:
                l+=1
            elif arr[l]+arr[r]>s:
                r-=1
            else:
                ja.append(arr[l])
                ja.append(arr[r])
                l+=1
                r-=1
        if len(ja)==n:
            print(*sorted(ja))
            quit()

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

Compiling 'tabletennis.py'...

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

=======
#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...