output_description: Print the minimum amount of money required to prepare X A-pizzas and Y
  B-pizzas.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      A B C X Y
attempt: import glob
  
  # 問題ごとのディレクトリのトップからの相対パス
  REL_PATH = "ABC\\95\\C"
  
  # テスト用ファイル置き場のトップ
  TOP_PATH = "C:\\AtCoder"
  
  
  class Common:
  
      problem = []
      index = 0
  
      def __init__(self, rel_path):
          self.rel_path = rel_path
  
      def initialize(self, path):
          file = open(path)
          self.problem = file.readlines()
          self.index = 0
          return
  
      def input_data(self):
          try:
              IS_TEST
              self.index += 1
              return self.problem[self.index - 1]
  
          except NameError:
              return input()
  
      def resolve(self):
          pass
  
      def exec_resolve(self):
          try:
              IS_TEST
              for path in glob.glob(TOP_PATH + "\\" + self.rel_path + "/*.txt"):
                  print("Test: " + path)
                  self.initialize(path)
                  self.resolve()
                  print("\n\n")
          except NameError:
              self.resolve()
  
  
  class Solver(Common):
  
      def resolve(self):
  
          q = [int(i) for i in self.input_data().split()]
          A = q[0]
          B = q[1]
          C = q[2]
          X = q[3]
          Y = q[4]
  
          if 2 * C > A + B:
              result = A * X + B * Y
          else:
              if X > Y:
                  result = C * Y * 2
                  if A > C * 2:
                      result += (X - Y) * C * 2
                  else:
                      result += (X - Y) * A
  
              else:
                  result = C * X * 2
                  if B > C * 2:
                      result += (Y - X) * C * 2
                  else:
                      result += (Y - X) * B
  
          print(str(result))
  
  
  solver = Solver(REL_PATH)
  solver.exec_resolve()
  
problem_description: Statement
  
  "Pizza At", a fast food chain, offers three kinds of pizza: "A-pizza",
  "B-pizza" and "AB-pizza". A-pizza and B-pizza are completely different pizzas,
  and AB-pizza is one half of A-pizza and one half of B-pizza combined together.
  The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen
  (yen is the currency of Japan), respectively.
  
  Nakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He
  can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or
  buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza.
  At least how much money does he need for this? It is fine to have more pizzas
  than necessary by rearranging pizzas.
samples: [{"input": "1500 2000 1600 3 2", "output": "7900\n    \n\nIt is optimal to buy four AB-pizzas and rearrange them into two A-pizzas and\ntwo B-pizzas, then buy additional one A-pizza.\n\n* * *"}, {"input": "1500 2000 1900 3 2", "output": "8500\n    \n\nIt is optimal to directly buy three A-pizzas and two B-pizzas.\n\n* * *"}, {"input": "1500 2000 500 90000 100000", "output": "100000000\n    \n\nIt is optimal to buy 200000 AB-pizzas and rearrange them into 100000 A-pizzas\nand 100000 B-pizzas. We will have 10000 more A-pizzas than necessary, but that\nis fine."}]