用混合背包做的，只有80分

#include <iostream>
using namespace std;

struct shu {
	int s, m, c;
};
shu a[10005];
int dp[10005][1005];

int main() {
	int sh, sm, eh, em, at;
	char aa, ab;
	cin >> sh >> aa >> sm >> eh >> ab >> em;
	at = (eh - sh) * 60 + em - sm;
	int n;
	cin >> n;
//	cout << at << endl;

	for (int i = 1; i <= n; i++) {
		int l, k, m;
		cin >> l >> k >> m;
		a[i].s = l, a[i].m = k, a[i].c = m;
	}

	for (int i = 1; i <= n; i++) {
		int cnt = a[i].c;

		if (cnt == 0) {
			for (int j = a[i].s; j <= at; j++) {
				dp[i][j] = max(dp[i][j - a[i].s] + a[i].m, dp[i - 1][j]);
			}
		}

		for (int j = at; j >= a[i].s; j--) {
			for (int l = 1; l <= min(cnt, j / a[i].s); l++) {
//				cout << i << " " << j << " " << l << endl;
				dp[i][j] = max(dp[i][j], max(dp[i - 1][j], dp[i - 1][j - l * a[i].s] + l * a[i].m));
			}
		}

		for (int j = 1; j <= a[i].s; j++) {
			dp[i][j] = max(dp[i][j], dp[i - 1][j]);
		}
	}

	/*	for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= at; j++) {
				cout << dp[i][j] << " ";
			}

			cout << endl;
		}
	*/
	int ans = 0;

	for (int i = 1; i <= at; i++) {
		ans = max(ans, dp[n][i]);
	}

	cout << ans;
	return 0;
}