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: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ConsoleApp1
{
    class Program
    {
        static void Main(string[] args)
        {
            string[] input = System.Console.ReadLine().Split(' ');
            int A = int.Parse(input[0]), B = int.Parse(input[1]), AB = int.Parse(input[2]), _A = int.Parse(input[3]), _B = int.Parse(input[4]);
            int tmp_A = 0, tmp_B = 0;
            int min;
            if (_A < _B) min = _A;
            else min = _B;
            if (_A % 2 == 1) {
                tmp_A++;
                _A--;
            }
            if (_B % 2 == 1) {
                tmp_B++;
                _B--;
            }
            long ary = 0;
            if (A + B >= 2 * AB) ary += (2 * AB) * min;
            else ary += ( A  + B) * min ;
            if (_A > _B)
            {
                if (A < 2 * AB) ary += A * (_A - min);
                else ary += (2 * AB) * (_A - min);
            }
            else
            {
                if (B < 2 * AB) ary += B * (_B - min);
                else ary += (2 * AB) * (_B - min);
            }
            /*if (A < 2 * AB) ary += A * tmp_A;
            else ary += 2 * AB * tmp_A;
            if (B < 2 * AB) ary += B * tmp_B;
            else ary += 2 * AB * tmp_B;*/
            System.Console.WriteLine(ary);
        }
    }
}