pat-top 1002. Business (35)

https://www.patest.cn/contests/pat-t-practise/1002

有条件的动态规划：先要排序，保证deadline靠前的task先考略，否则可能会被排在前面的deadline晚但是profit大的task 淹没而不能被考虑。

#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

typedef struct task {
	int p, l, d;
	task(int _p, int _l, int _d) {
		p = _p;
		l = _l;
		d = _d;
	}
	friend bool operator < (struct task a, struct task b) {
		return a.d < b.d;
	}
}Task;

int main()
{
	int n, p, l, d,maxD=0;
	scanf("%d", &n);
	vector<Task> tasks;
	
	for (int i = 0; i < n; i++)
	{
		scanf("%d %d %d", &p, &l, &d);
		if (maxD < d) maxD = d;
		Task t(p, l, d);
		tasks.push_back(t);
	}
	/** Here we have to sort to make sure task with early deadline could be consider,
	*	since task with later deadline, could be reconsider later.
	*	For example, t[0] p:7,l:1,d:2, t[1]:p:5,l:1,d:1
	*   If not sort, first iteration dp[1-2] = {7,7}, seconde iteration: dp[1-2] ={7,7}
	*	If sort first iteration dp[1-2] = {5,5}, second iteration: dp[1-2] = {7,12}
	*/
	sort(tasks.begin(), tasks.end());
	
	int *dp = new int[maxD+1];
	fill(dp, dp + maxD + 1, 0);
	int ans = 0;
	for (int i = 0; i < n; i++)
	{
		for (int j = maxD; j >= tasks[i].l; j--)
		{
			if (j <= tasks[i].d) {
				dp[j] = max(dp[j], dp[j - tasks[i].l] + tasks[i].p);
				if (dp[j] > ans) ans = dp[j];
			}
		}
	}
	printf("%d\n", ans);
    return 0;
}