Submission #1758801

---

Source Code Expand

class Array
  def count
    k = Hash.new(0)
    self.each{|x| k[x] += 1 }
    return k
  end
end

class Solver
  def solve(n, members)
    hash = members.count
    peple = hash.max{ |x, y| x[1] <=> y[1] } 
    peple[0]
  end
end


n = gets.to_i
members = []

n.times do
  m = gets.chomp
  members  << m
end

puts Solver.new.solve(n, members)

Submission Info

Judge Result