import std.stdio, std.conv, std.string;
import std.algorithm, std.array, std.container;
import std.numeric, std.math;
import core.bitop;

T RD(T)() { static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res.to!T; }
string RDR() { return readln.chomp; }

long mod = pow(10, 9) + 7;
long moda(long x, long y) { return (x + y) % mod; }
long mods(long x, long y) { return ((x + mod) - (y % mod)) % mod; }
long modm(long x, long y) { return (x * y) % mod; }

void main()
{
	auto A = RD!ulong;
	auto B = RD!ulong;
	auto C = RD!ulong;
	auto X = RD!ulong;
	auto Y = RD!ulong;
	
	ulong ans;
	auto xy = min(X, Y);
	ans += min(C * xy * 2, (A + B) * xy);

	ulong cost;
	if (X > Y) cost = A;
	else	   cost = B;
	auto q = max(X, Y) - min(X, Y);
	ans += min(C * q * 2, cost * q);

	writeln(ans);
	stdout.flush();
}