#sort def quicksort(a): if len(a)==0: return [] pivot=a[0] left=[] right=[] for x in a[1:]: if x < pivot: left.append(x) else: right.append(x) return quicksort(left)+[pivot]+quicksort(right) #input b=list(input().split(" ")) c=[] for i in range(len(b)): c.append(int(b[i])) #output a=quicksort(c) for i in range(len(a)-1): print(a[i],end="") print("->",end="") print(a[-1])
you are sweat
sweat = try hard