fork download
  1. A=[4,10,15,20]
  2. B=[1,13,29]
  3. C=[5,14,28]
  4. A.sort(),B.sort(),C.sort()
  5. i=0
  6. j=0
  7. k=0
  8. t=-1
  9. An=len(A)
  10. Bn=len(B)
  11. Cn=len(C)
  12. Max=0
  13. Min=min_dif=99999
  14. while i<An and j<Bn and k<Cn:
  15. if A[i]>Max:
  16. Max=A[i]
  17. if B[j]>Max:
  18. Max=B[j]
  19. if C[k]>Max:
  20. Max=C[k]
  21. if A[i]<Min:
  22. Min=A[i]
  23. t=1
  24. if B[j]<Min:
  25. Min=B[j]
  26. t=2
  27. if C[k]<Min:
  28. Min=C[k]
  29. t=3
  30.  
  31.  
  32. if Max-Min < min_dif:
  33. min_dif=Max-Min
  34. min_i=i
  35. min_j=j
  36. min_k=k
  37.  
  38. if t==1:
  39. i=i+1
  40. if t==2:
  41. j=j+1
  42. if t==3:
  43. k=k+1
  44. Max=0
  45. Min=99999
  46. print "A=",A[min_i]," B=",B[min_j]," C=",C[min_k]," min diff=",min_dif
  47.  
Success #stdin #stdout 0.01s 6660KB
stdin
Standard input is empty
stdout
A= 15  B= 13  C= 14  min diff= 2