1 solutions

  • 0
    @ 2025-3-3 16:33:14

    C++ :

    #include<bits/stdc++.h>
    using namespace std;
    int dp[100001];
    int t[10001],v[10001];
    int main(){
    	int T,M,i,j;
    	cin>>T>>M;
    	for(i=1;i<=M;i++){
    		cin>>t[i]>>v[i];
    	}
    	for(i=1;i<=M;i++){
    		for(j=t[i];j<=T;j++){
    			dp[j] = max(dp[j],dp[j-t[i]]+v[i]);
    		}
    	}
    	cout<<dp[T];
    
    	return 0;
    }
    
    
    • 1

    Information

    ID
    10543
    Time
    1000ms
    Memory
    128MiB
    Difficulty
    (None)
    Tags
    # Submissions
    0
    Accepted
    0
    Uploaded By