import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;

public class Main {

	@SuppressWarnings("resource")
	public static void main(String args[]) {
		Scanner scanner = new Scanner(System.in);
		int a = scanner.nextInt();
		int b = scanner.nextInt();
		int c = scanner.nextInt();
		int x = scanner.nextInt();
		int y = scanner.nextInt();
		Map<Integer, Integer> map = new TreeMap<>();
		int xy[] = new int[2];

		map.put(x, a);
		map.put(y, b);

		int i = 0;
		for (int k : map.keySet()) {
			xy[i] = k;
			i++;
		}

		int ans = 0;
		ans = Math.min(a * xy[0] + b * xy[0], c * xy[0] * 2);

		if (x != y) {
			int t = xy[1] - xy[0];
			ans += Math.min(map.get(xy[1]) * t, c * t * 2);
		}

		System.out.println(ans);

	}
}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz