Submission #2082624

---

Source Code Expand

n = gets.to_i
xs = gets.split(" ").map(&:to_i)   # 売却価格
cs = gets.split(" ").map(&:to_i)   # 販売価格
vs = gets.split(" ").map(&:to_i)   # 価値

selling = [true] * n
have_from = 0
money = 0

# 販売されているもののうち, 価値に比べて販売価格が最も下回っているものの番号を返す
def n_max_moukaru(cs, vs, selling)
  num = -1
  maxval = 0
#  maxval = -9999999999999
  [*0..(cs.size-1)].each{|i|
    if (vs[i] - cs[i]) > maxval and selling[i] then
      maxval = vs[i] - cs[i]
      num = i
    end
  }
  return num
end

# money で購入可能なもののうち, 価値に比べて販売価格が最も下回っているものの番号を返す.
# もし何も買えない場合, money で購入可能でないものについても調べて返す
def n_max_sonsuru(cs, vs, selling, money)
  num = -1
  maxval = -9999999999999
  [*0..(cs.size-1)].each{|i|
    if (vs[i] - cs[i]) > maxval and selling[i] and money >= cs[i] then
      maxval = vs[i] - cs[i]
      num = i
    end
  }
  num = n_max_moukaru(cs, vs, selling) if num == -1
  return num
end

total_value = 0
[*0..(n-1)].each{|i|
  itmp = n_max_moukaru(cs, vs, selling)
  if itmp >= 0 and money >= cs[itmp] then
    # 購入
    total_value += vs[itmp]
    money -= cs[itmp]
  else
    # 売却
    money += xs[have_from]
    have_from += 1
  end

  itmp = n_max_sonsuru(cs, vs, selling, money)
  selling[itmp] = false
}

puts total_value

Submission Info

Judge Result