Problem:
Score : 300 points

Problem 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.

Constraints

1 ≤ A, B, C ≤ 5000

1 ≤ X, Y ≤ 10^5

All values in input are integers.

Input

Input is given from Standard Input in the following format:

A B C X Y

Output

Print the minimum amount of money required to prepare X A-pizzas and Y B-pizzas.

Sample Input 1

1500 2000 1600 3 2

Sample Output 1

7900

It is optimal to buy four AB-pizzas and rearrange them into two A-pizzas and two B-pizzas, then buy additional one A-pizza.

Sample Input 2

1500 2000 1900 3 2

Sample Output 2

8500

It is optimal to directly buy three A-pizzas and two B-pizzas.

Sample Input 3

1500 2000 500 90000 100000

Sample Output 3

100000000

It is optimal to buy 200000 AB-pizzas and rearrange them into 100000 A-pizzas and 100000 B-pizzas. We will have 10000 more A-pizzas than necessary, but that is fine.

Solution in C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Collections;
using System.Collections.Generic;
using System.Text;
using System.IO;
using System.Linq;
using System.Diagnostics;
using System.Globalization;
using static System.Console;
using static System.Math;


namespace abc95_c
{
    class Program
    {
        static void Main(string[] args)
        {
            int[] input = ReadLine().Split().Select(int.Parse).ToArray();
            int a = input[0];
            int b = input[1];
            int c = input[2];
            double x = input[3];
            double y = input[4];

            var tmp1 = a*x+b*y;
            var tmp2 = c*2*x;
            if(y - x > 0) tmp2 += (y-x)*b;
            var tmp3 = c*2*y;
            if(x - y > 0) tmp3 += (x-y)*a;
            WriteLine(Min(tmp1, Min(tmp2, tmp3)));

            //if(c*2 <= a && c*2 <= b)
            //{
            //    var max = Max(x,y);
            //    WriteLine(c*2*max);
            //}
            //else if(c*2 >= a+b)
            //{
            //    WriteLine(a*x+b*y);
            //}
            //else if(c <= b && c >= a)
            //{
            //    if(x-y<0)
            //    {
            //        WriteLine(c*2*x+(y-x)*b);
            //    }
            //    else
            //    {
            //        WriteLine(c*2*y+(x-y)*a);
            //    }
            //}
            //else
            //{
            //    if(y-x<0)
            //    {
            //        WriteLine(c*2*y+(x-y)*a);
            //    }
            //    else
            //    {
            //        WriteLine(c*2*x+(y-x)*b);
            //    }
            //}
        }
    }
}