
# slower version:

s = input()
for i in range(len(s)):
  if i%2 == 0:
    print(s[i], end = '')


# optimized version of the same code:

s = input()
ans = ''
for i in range(len(s)):
  if i % 2 == 0:
    ans += s[i]
print(ans)



# slower version:

import sys

sys.setrecursionlimit(10 ** 6)

# input = sys.stdin.readline    ####

int1 = lambda x: int(x) - 1

def II(): return int(eval(input()))



def MI(): return list(map(int, input().split()))

def MI1(): return list(map(int1, input().split()))



def LI(): return list(map(int, input().split()))

def LI1(): return list(map(int1, input().split()))

def LLI(rows_number): return [LI() for _ in range(rows_number)]



def printlist(lst, k='\n'): print((k.join(list(map(str, lst)))))

INF = float('inf')



def solve():

    a, b, c, x, y = MI()



    ans = INF

    for k in range(100001):

        yen = 2 * c * k + max(0, x-k) * a + max(0, y-k) * b

        ans = min(ans, yen)

    print(ans)





if __name__ == '__main__':

    solve()


# optimized version of the same code:

import sys

sys.setrecursionlimit(10 ** 6)

# input = sys.stdin.readline    ####

int1 = lambda x: int(x) - 1

def II(): return int(eval(input()))



def MI(): return list(map(int, input().split()))

def MI1(): return list(map(int1, input().split()))



def LI(): return list(map(int, input().split()))

def LI1(): return list(map(int1, input().split()))

def LLI(rows_number): return [LI() for _ in range(rows_number)]



def printlist(lst, k='\n'): print((k.join(list(map(str, lst)))))

INF = float('inf')



def solve():

    a, b, c, x, y = MI()



    ans = 0

    if a + b <= 2 * c:

        mn = min(x, y)

        ans = a * mn + b * mn + max(0, x-mn) * min(a, 2*c) + max(0, y-mn) * min(b, 2*c)



    else:

        mn = min(x, y)

        ans = mn * 2 * c + max(0, x-mn) * min(a, 2*c) + max(0, y-mn) * min(b, 2*c)



    print(ans)







if __name__ == '__main__':

    solve()

import sys

sys.setrecursionlimit(10**6)
# input = sys.stdin.readline    ####
int1 = lambda x: int(x) - 1


def II():
    return int(eval(input()))


def MI():
    return list(map(int, input().split()))


def MI1():
    return list(map(int1, input().split()))


def LI():
    return list(map(int, input().split()))


def LI1():
    return list(map(int1, input().split()))


def LLI(rows_number):
    return [LI() for _ in range(rows_number)]


def printlist(lst, k="\n"):
    print((k.join(list(map(str, lst)))))


INF = float("inf")


def solve():
    a, b, c, x, y = MI()
    ans = INF
    for k in range(100001):
        yen = 2 * c * k + max(0, x - k) * a + max(0, y - k) * b
        ans = min(ans, yen)
    print(ans)


if __name__ == "__main__":
    solve()

import sys

sys.setrecursionlimit(10**6)
# input = sys.stdin.readline    ####
int1 = lambda x: int(x) - 1


def II():
    return int(eval(input()))


def MI():
    return list(map(int, input().split()))


def MI1():
    return list(map(int1, input().split()))


def LI():
    return list(map(int, input().split()))


def LI1():
    return list(map(int1, input().split()))


def LLI(rows_number):
    return [LI() for _ in range(rows_number)]


def printlist(lst, k="\n"):
    print((k.join(list(map(str, lst)))))


INF = float("inf")


def solve():
    a, b, c, x, y = MI()
    ans = 0
    if a + b <= 2 * c:
        mn = min(x, y)
        ans = (
            a * mn
            + b * mn
            + max(0, x - mn) * min(a, 2 * c)
            + max(0, y - mn) * min(b, 2 * c)
        )
    else:
        mn = min(x, y)
        ans = (
            mn * 2 * c + max(0, x - mn) * min(a, 2 * c) + max(0, y - mn) * min(b, 2 * c)
        )
    print(ans)


if __name__ == "__main__":
    solve()

-    ans = INF -    for k in range(100001): -        yen = 2 * c * k + max(0, x - k) * a + max(0, y - k) * b -        ans = min(ans, yen) +    ans = 0 +    if a + b <= 2 * c: +        mn = min(x, y) +        ans = ( +            a * mn +            + b * mn +            + max(0, x - mn) * min(a, 2 * c) +            + max(0, y - mn) * min(b, 2 * c) +        ) +    else: +        mn = min(x, y) +        ans = ( +            mn * 2 * c + max(0, x - mn) * min(a, 2 * c) + max(0, y - mn) * min(b, 2 * c) +        )