Codeforces•Sep 06, 2025
There Are Two Types Of Burgers
Hazrat Ali
Codeforces
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.
Input
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.
Output
For each query print one integer — the maximum profit you can achieve.
Example
Input
3 15 2 3 5 10 7 5 2 10 12 1 100 100 100 100
Output
40 34 0
Solution
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
while (t--)
{
int b, p, f;
cin >> b >> p >> f;
int h, c;
cin >> h >> c;
int ans = 0;
if (h > c)
{
ans += h * min(b / 2, p);
b -= 2 * min(b / 2, p);
ans += c * min(b / 2, f);
b -= 2 * min(b / 2, f);
}
else
{
ans += c * min(b / 2, f);
b -= 2 * min(b / 2, f);
ans += h * min(b / 2, p);
b -= 2 * min(b / 2, p);
}
cout << ans << endl;
}
return 0;
}