fork(2) download
  1. import sys
  2.  
  3. n = int(sys.stdin.readline())
  4. slist = []
  5.  
  6. for i in range(n):
  7. slist.append(sys.stdin.readline())
  8.  
  9. slist = set(slist)
  10. slist = list(slist)
  11.  
  12. def merge(list,l,m,r):
  13. sorted = []
  14. i = l
  15. j = m + 1
  16. k = 0
  17. while i <= m and j <= r:
  18. if len(list[i]) < len(list[j]):
  19. sorted.append(list[i])
  20. i = i + 1
  21. k = k + 1
  22. elif len(list[i]) > len(list[j]):
  23. sorted.append(list[j])
  24. j = j + 1
  25. k = k + 1
  26. else:
  27. if list[i] < list[j]:
  28. sorted.append(list[i])
  29. i = i + 1
  30. k = k + 1
  31. else:
  32. sorted.append(list[j])
  33. j = j + 1
  34. k = k + 1
  35. while i <= m:
  36. sorted.append(list[i])
  37. i = i + 1
  38. k = k + 1
  39. while j <= r:
  40. sorted.append(list[j])
  41. j = j + 1
  42. k = k + 1
  43. k = k - 1
  44. while k >= 0:
  45. list[l+k] = sorted[k]
  46. k = k - 1
  47. return list
  48.  
  49. def divide(list,l,r):
  50. if l < r:
  51. mid = (l+r)//2
  52. divide(list,l,mid)
  53. divide(list,mid+1,r)
  54. merge(list,l,mid,r)
  55. return list
  56. else:
  57. return list
  58.  
  59. sortlist = divide(slist,0,len(slist)-1)
  60.  
  61. for i in sortlist:
  62. print(i)
  63.  
Success #stdin #stdout 0.02s 9216KB
stdin
13
but
i
wont
hesitate
no
more
no
more
it
cannot
wait
im
yours
stdout
i

im

it

no

but

more

wait

wont

yours
cannot

hesitate