fork download
  1. def closest_valid_sum(A, B, X):
  2. n, m = len(A), len(B)
  3.  
  4. i = 0
  5. j = m - 1
  6. best_sum = float('-inf')
  7.  
  8. while i < n and j >= 0:
  9. current_sum = A[i] + B[j]
  10.  
  11. if current_sum > X:
  12.  
  13. j -= 1
  14. else:
  15.  
  16. best_sum = max(best_sum, current_sum)
  17. i += 1
  18.  
  19. return best_sum
Success #stdin #stdout 0.08s 7908KB
stdin
Standard input is empty
stdout
Standard output is empty