Files
PS/boj/15664.py
Gyubin Han 2600340c03 first commit
from old repository to a new repository
2024-04-30 16:59:10 +09:00

23 lines
392 B
Python

n,m=map(int,input().split())
inarr=list(map(int,input().split()))
arr=[]
ch=[False]*n
inarr.sort()
def bt(s):
if len(arr)==m:
print(*arr)
return
l=0
for i in range(s,n):
if not ch[i] and l!=inarr[i]:
ch[i]=True
arr.append(inarr[i])
bt(i)
arr.pop()
ch[i]=False
l=inarr[i]
bt(0)