TOJ-3135- Giant Screen

//懒得想变量名称

#include <cstdio>
#include <queue>
#include <cstdlib>
using namespace std;

int rh0, rv0, sh0, sv0; 

int main()
{
	int rh, rv, sh, sv, n, price, ans, tmp, l, m;
	scanf("%d%d%d%d", &rh0, &rv0, &sh0, &sv0);
	scanf("%d", &n);
	priority_queue<int> Q;
	for (int i = 0; i < n; i++)
	{
		scanf("%d%d%d%d%d", &rh, &rv, &sh, &sv, &price);
		tmp = -1 * price * max((rh0 + rh - 1) / rh, (sh0 + sh - 1) / sh) * max((rv0 + rv - 1) / rv, (sv0 + sv - 1) / sv);
		Q.push(tmp);
		tmp = -1 * price * max((rh0 + rv - 1) / rv, (sh0 + sv - 1) / sv) * max((rv0 + rh - 1) / rh, (sv0 + sh - 1) / sh);
		Q.push(tmp);
	}
	ans = -1 * Q.top();
	printf("%d\n", ans);
}