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 math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
  
  sys.setrecursionlimit(10**7)
  inf = 10**20
  eps = 1.0 / 10**10
  mod = 10**9 + 7
  dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
  ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
  
  
  def LI():
      return [int(x) for x in sys.stdin.readline().split()]
  
  
  def LI_():
      return [int(x) - 1 for x in sys.stdin.readline().split()]
  
  
  def LF():
      return [float(x) for x in sys.stdin.readline().split()]
  
  
  def LS():
      return sys.stdin.readline().split()
  
  
  def I():
      return int(sys.stdin.readline())
  
  
  def F():
      return float(sys.stdin.readline())
  
  
  def pf(s):
      return print(s, flush=True)
  
  
  A, B, C, X, Y = LI()
  
  
  """
  A+BよりもCのほうがお得な場合、XまたはYを買い切るまでCを買う
  その後は、AかBで残っているものとAB*2で安い方を買う
  """
  result = 0
  if A + B >= C * 2:
      # Cを購入する
      reduce_amount = min(X, Y)
      X -= reduce_amount
      Y -= reduce_amount
      result += C * 2 * reduce_amount
  
  if X > 0:
      result += min(C * 2 * X, A * X)
  
  if Y > 0:
      result += min(C * 2 * Y, B * Y)
  
  
  print(result)
  
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."}]