CF1207A.There Are Two Types Of Burgers
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
There are two types of burgers in your restaurant — hamburgers and chicken burgers! To assemble a hamburger you need two buns and a beef patty. To assemble a chicken burger you need two buns and a chicken cutlet.
You have b buns, p beef patties and f chicken cutlets in your restaurant. You can sell one hamburger for h dollars and one chicken burger for c dollars. Calculate the maximum profit you can achieve.
You have to answer t independent queries.
输入格式
The first line contains one integer t ( 1≤t≤100 ) – the number of queries.
The first line of each query contains three integers b , p and f ( 1≤b, p, f≤100 ) — the number of buns, beef patties and chicken cutlets in your restaurant.
The second line of each query contains two integers h and c ( 1≤h, c≤100 ) — the hamburger and chicken burger prices in your restaurant.
输出格式
For each query print one integer — the maximum profit you can achieve.
输入输出样例
输入#1
3 15 2 3 5 10 7 5 2 10 12 1 100 100 100 100
输出#1
40 34 0
说明/提示
In first query you have to sell two hamburgers and three chicken burgers. Your income is 2⋅5+3⋅10=40 .
In second query you have to ell one hamburgers and two chicken burgers. Your income is 1⋅10+2⋅12=34 .
In third query you can not create any type of burgers because because you have only one bun. So your income is zero.