Submission #8485627

---

Source Code Expand

#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll int N,T;
struct st{ ll A,B; }arr[3001];
struct dy{ ll t,c; }dp[3001];
map<ll,ll> jido;
int main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin>>N>>T;
	for(int i=1;i<=N;i++){
		cin>>arr[i].A>>arr[i].B;
		dp[i].t=9000000000; dp[i].c=0;
	}
	for(int i=1;i<=N;i++){
		for(int j=T-1;j>=0;j--){
			if((jido[j] || j==0)){
				jido[j+arr[i].A] = max(jido[j+arr[i].A], jido[j]+arr[i].B);
			}
		}
	}
	ll ans=0;
	for(int i=0;i<T+3000;i++) if(jido[i]) ans=max(ans,jido[i]);
	cout<<ans;
}

Submission Info

Judge Result