루미 알고리즘

#1435골드Computer Purchase

PO 2017 학교 예선코딩출제 Arash Rouhani영어 원문이 문제가 어렵다면 — 배우는 순서 보기

영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)

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.

GroupPointsConstraints
120n=2 and x,y ≤ 100
220n ≤ 6 and x,y ≤ 10
340n,x,y ≤ 100
420No additional constraints.

예제

예제 1

입력
3 300 2 500 2
출력
900

예제 2

입력
3 150 5 110 3
출력
300

예제 3

입력
58 364 37 255 13
출력
2330

출처 표기

출처: Programmeringsolympiaden 2017년 학교 예선 · 원문 페이지 · 이용 조건 CC BY-SA · LaTeX 원문을 화면용 글로 옮겼습니다(수식·표의 모양이 다를 수 있습니다). 내용은 고치지 않았습니다.

크리에이티브 커먼즈 저작자표시-동일조건변경허락.

문제 출처: 한국정보올림피아드(KOI) (CC BY-NC-SA 4.0) · International Olympiad in Informatics (IOI) (CC BY) · Centre for Education in Mathematics and Computing (CEMC), University of Waterloo (CC BY-NC 4.0) · Programmeringsolympiaden (CC BY-SA) · CSES Problem Set (Antti Laaksonen) (CC BY-NC-SA 4.0). 루미 알고리즘은 위 단체들과 관계없는 별도의 서비스이며, 자료는 원문 그대로 싣습니다. 문제마다 출처와 이용 조건을 따로 표기합니다.