Submission #24,909

2026-02-16 18:01:02

cpp17

Accepted 40/40

13ms

644 KiB

#include <bits/stdc++.h>
using namespace std;

int main(){
    int n,k;cin>>n>>k;
    vector<array<int,3>> v(n);
    for(int i=0;i<n;i++)cin>>v[i][2]>>v[i][1]>>v[i][0];
    vector<int> dp(k+1);
    int ans=0;
    sort(v.begin(),v.end());
    for(auto [a,c,b]:v){
        for(int i=k;i-b>=0;i--){
            dp[i]=max(dp[i],dp[i-b]+c);
        }
        ans=max(ans,dp[k-a]);
    }
    cout<<ans<<'\n';
}

	Sum	Test	Verdict		Time	Memory
base	40/40
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	2ms	316 KiB
		3	Accepted	2/2	1ms	316 KiB
		4	Accepted	2/2	1ms	316 KiB
		5	Accepted	1/1	1ms	316 KiB
		6	Accepted	2/2	1ms	316 KiB
		7	Accepted	2/2	2ms	316 KiB
		8	Accepted	2/2	1ms	316 KiB
		9	Accepted	2/2	1ms	316 KiB
		10	Accepted	2/2	1ms	316 KiB
		11	Accepted	3/3	4ms	424 KiB
		12	Accepted	3/3	4ms	500 KiB
		13	Accepted	3/3	4ms	508 KiB
		14	Accepted	3/3	4ms	316 KiB
		15	Accepted	3/3	4ms	372 KiB
		16	Accepted	4/4	4ms	316 KiB
		17	Accepted	1/1	12ms	316 KiB
		18	Accepted	1/1	12ms	456 KiB
		19	Accepted	1/1	13ms	464 KiB
		20	Accepted	1/1	13ms	644 KiB
		21	Accepted	1/1	12ms	492 KiB
		22	Accepted	1/1	13ms	508 KiB