306499: CF1207A. There Are Two Types Of Burgers
Memory Limit:256 MB
Time Limit:1 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
There Are Two Types Of Burgers
题意翻译
### 题目描述 在你的餐厅里有两种汉堡:牛肉汉堡和鸡肉汉堡。每个牛肉汉堡需要$2$片面包和$1$片牛肉,一个鸡肉汉堡需要$2$片面包和$1$个鸡排。 一个牛肉汉堡卖$h$元,一个鸡肉汉堡卖$c$元。 你有$b$片面包,$p$片牛肉和$f$块鸡排。求最大收益。 ### 输入格式 第一行,t,表示数据组数。$1\leqslant t \leqslant 100$ 对于每一组数据:第一行,三个整数$b,p,f(1\leqslant b,p,f \leqslant 100)$ 第二行,两个整数$h,c(1 \leqslant h,c \leqslant 100)$ ### 输出格式 对于每一组数据,输出最大收益。题目描述
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 \le t \le 100 $ ) – the number of queries. The first line of each query contains three integers $ b $ , $ p $ and $ f $ ( $ 1 \le b, ~p, ~f \le 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 \le h, ~c \le 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