提出 #4104499

---

ソースコード 拡げる

n = gets.chomp.to_i
dishes = Array.new(n).map{Array.new(2,0)}
n.times do |i|
    dishes[i][0], dishes[i][1] = gets.chomp.split.map(&:to_i)
end
dishes.sort! do |a,b|
     (a[0]-a[1] <=> b[0]-b[1]).nonzero? || (b[0]+b[1] <=> a[0]+a[0])
end
sum = 0
turn = 1
dishes.each do |d|
    if turn == 1
        dish = d[0]
    else
        dish = d[1]
    end
    sum += dish * turn
    turn *= -1
end
puts sum

提出情報

ジャッジ結果