영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
Problem
A company has just bought new computers: x desktops and y laptops. A desktop computer costs a dollars and a laptop costs b dollars. The company has n departments, and they are considered to differ in importance relative to one another. The CEO has decided that the computers should be distributed according to the following simple rule: A more important department must receive computers worth at least as much as a less important department.
Klara is tasked with making the distribution. Even though Klara is very skilled, she works at the least important department. To become popular among her department colleagues, she of course wants to secure computers of the highest possible value for her department. She has asked you for help! Write a program that, given the variables x, a, y, b and n, computes the highest possible value of the computers that Klara's department can receive.
Input
The input consists of one line with the integers x, a, y, b and n (0 ≤ x,y ≤ 1000, 1 ≤ a,b ≤ 1000, 2 ≤ n ≤ 1000).
Output
Print an integer: the highest possible value of the computers given to the least important department.
Scoring
Your solution will be tested on a set of test groups. To earn points for a group, you must pass all test cases in that group.
| Group | Points | Constraints |
|---|---|---|
| 1 | 20 | n=2 and x,y ≤ 100 |
| 2 | 20 | n ≤ 6 and x,y ≤ 10 |
| 3 | 40 | n,x,y ≤ 100 |
| 4 | 20 | No additional constraints. |
예제
예제 1
3 300 2 500 2
900
예제 2
3 150 5 110 3
300
예제 3
58 364 37 255 13
2330