How do I solve this QUESTION.... I'm not able to understand it. I want to solve it in JAVA

See more:

Java

JavaSE

A procurement of new clothing has arrived a store. The procurement contain 'm' Caps, 'n' Shirts, 'o' Pants and 'p' Shoes.

The store sells two types of clothing set:

First set consist of one cap and one shoes;
Second set consist of one shirt, one pants and one shoe. The First set costs 'a' coins and Second set costs 'b' coins
What could be the maximum possible cost of a set that can be assembled from the arrived clothings?

Note : One item cannot be used in more than one set however some items may be left unused.

Input Format

m(1≤m≤100000) — the number of caps.

n(1≤n≤100000) — the number of shirts.

o(1≤o≤100000) — the number of pants.

p(1≤p≤100000) — the number of shoes.

a(1≤a≤1000) — Cost of first set

b(1≤b≤1000) — Cost of second set

Constraints

m(1≤m≤100000) n(1≤n≤100000) o(1≤o≤100000) p(1≤p≤100000) a(1≤a≤1000) b(1≤b≤1000)

Output Format

The maximum total cost of the set.

Sample Input 0

4
5
6
3
1
2
Sample Output 0

6
Explanation 0


Set of clothes
The optimal solution here is to compose three clothing set of the first type and four clothing set of the second type. The total cost is 3⋅2+4⋅0=6.

Sample Input 1

100000
100000
100000
100000
1000
1
Sample Output 1

100000000

What I have tried:

I am not able to understand this qs