204302026-01-06 18:18:22algoproBefektetéscpp17Runtime error 34/4039ms32768 KiB
// UUID: 30ed49b3-5625-4591-8346-f7552fba6070
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, k; cin>>n>>k;
	vector<array<int, 3>> l(n+1); //ado, ar, ertek
	for(int i=1; i<=n; i++){
		cin>>l[i][1]>>l[i][2]>>l[i][0];
	}
	sort(l.begin(), l.end());

	vector<vector<int>> dp(n+1, vector<int>(k+1));
	int mx=0;
	for(int i=1; i<=n; i++){
		for(int j=0; j<=k; j++){
			if(j<l[i][0]){dp[i][j]=-1e9; continue;}
			int a=l[i][0]-l[i-1][0];
			if(j-a>=0){dp[i][j]=dp[i-1][j-a];}
			//dp[i][j]=max(dp[i-1][j]+a, 0);
			if(j-a-l[i][1]>=0){
				dp[i][j]=max(dp[i][j], dp[i-1][j-a-l[i][1]]+l[i][2]);
			}
			mx=max(mx, dp[i][j]);
		}
	}
	cout<<mx;

	/*for(int i=0; i<=n; i++){
		cout<<endl;
		for(int j=0; j<=k; j++){
			cout<<dp[i][j]<<"\t";
		}
	}*/
}
SubtaskSumTestVerdictTimeMemory
base34/40
1Accepted0/01ms316 KiB
2Accepted0/08ms4148 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms500 KiB
5Accepted1/11ms316 KiB
6Accepted2/21ms564 KiB
7Accepted2/21ms564 KiB
8Accepted2/21ms780 KiB
9Accepted2/22ms564 KiB
10Accepted2/21ms564 KiB
11Accepted3/321ms16168 KiB
12Accepted3/325ms16060 KiB
13Accepted3/321ms16124 KiB
14Accepted3/325ms16008 KiB
15Accepted3/325ms15924 KiB
16Accepted4/425ms16168 KiB
17Runtime error0/132ms32768 KiB
18Runtime error0/132ms32768 KiB
19Runtime error0/139ms32768 KiB
20Runtime error0/139ms32768 KiB
21Runtime error0/137ms32768 KiB
22Runtime error0/132ms32768 KiB