fork(1) download
  1. require 'minitest/autorun'
  2.  
  3. A=->x{x.reduce(0.0,:+)/x.size}
  4. F=->q{b,a=q.sort_by{|x|A[x]};a.any?{|x|x<A[a]&&x>A[b]}}
  5.  
  6. describe F do
  7. def test_truthy_cases
  8. [
  9. [[1], [2, 3]],
  10. [[1, 2, 3], [4, 5, 6]],
  11. [[3, 4, 5, 6], [2, 3, 4, 5]],
  12. [[6, 5, 9, 5, 6, 0], [6, 2, 0, 9, 5, 2]],
  13. [[0, 4], [9, 1, 0, 2, 8, 0, 5, 5, 4, 9]]
  14. ].each do |arrays|
  15. assert F[arrays]
  16. end
  17. end
  18.  
  19. def test_falsy_cases
  20. [
  21. [[1], [2]],
  22. [[2, 4], [5]],
  23. [[1, 5], [2, 3, 4, 5]],
  24. [[2, 1, 2, 3, 1, 3], [5, 1, 6]],
  25. [[4, 4, 5, 2, 4, 0], [9, 2, 10, 1, 9, 0]]
  26. ].each do |arrays|
  27. refute F[arrays]
  28. end
  29. end
  30. end
  31.  
Success #stdin #stdout 0.06s 8528KB
stdin
Standard input is empty
stdout
Run options: --seed 37401

# Running tests:

..

Finished tests in 0.000839s, 2382.4045 tests/s, 11912.0226 assertions/s.

2 tests, 10 assertions, 0 failures, 0 errors, 0 skips