Submission #1231779

#	Time	Username	Problem	Language	Result	Execution time	Memory
1231779		durdona	Table Tennis (info1cup20_tabletennis)	Pypy 3	87 / 100	3097 ms	136632 KiB

tabletennis

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()))
arr.sort()
for i in range(k+1):
    for j in range(n-1,n+k):
        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()

Compilation message (stdout)

Compiling 'tabletennis.py'...

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

=======

• Subtask 1: 11 / 11
• Subtask 2: 9 / 9
• Subtask 3: 14 / 14
• Subtask 4: 15 / 15
• Subtask 5: 9 / 9
• Subtask 6: 14 / 14
• Subtask 7: 15 / 15
• Subtask 8: 0 / 13