Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- require 'set'
- class SortedSet
- def max
- @keys[-1]
- end
- def min
- @keys[0]
- end
- end
- N = gets.chomp.to_i
- Y = gets.split.map &:to_i
- s = SortedSet.new(Y)
- s.first
- p s.max
- p s.min
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement