fork download
  1. def find_intersection(arr1, arr2):
  2. intersection = []
  3. for num in arr1:
  4. if num in arr2:
  5. intersection.append(num)
  6. arr2.remove(num)
  7. return intersection
  8.  
  9. def find_union(arr1, arr2):
  10. union = arr1 + arr2
  11. union.sort()
  12. union = list(dict.fromkeys(union)) # Remove duplicates
  13. return union
  14.  
  15. def main():
  16. # Input sizes of arrays
  17. n, m = map(int, input().split())
  18.  
  19. # Input arrays
  20. arr1 = list(map(int, input().split()))
  21. arr2 = list(map(int, input().split()))
  22.  
  23. # Find intersection
  24. intersection = find_intersection(arr1, arr2)
  25.  
  26. # Find union
  27. union = find_union(arr1, arr2)
  28.  
  29. # Print intersection
  30. if intersection:
  31. print(*intersection)
  32. else:
  33. print(-1)
  34.  
  35. # Print union
  36. if union:
  37. print(*union)
  38. else:
  39. print(-1)
  40.  
  41. if __name__ == "__main__":
  42. main()
  43.  
Success #stdin #stdout 0.03s 9844KB
stdin
5 4
3 1 4 1 5
2 7 1 8
stdout
1
1 2 3 4 5 7 8