1 solutions

  • 0
    @ 2025-4-26 15:12:28
    #include <bits/stdc++.h>
    using namespace std;
    int times,m,t[105],a[105],dp[1005];
    int main() {
    	scanf("%d%d",&times,&m);
    	for(int i = 1;i<=m;i++)scanf("%d%d",&t[i],&a[i]);
    	for(int i = 1;i<=m;i++)
    		for(int j = times;j>=t[i];j--)dp[j] = max(dp[j],dp[j-t[i]]+a[i]);
    	printf("%d",dp[times]);
    	return 0;
    }
    
    • 1

    Information

    ID
    537
    Time
    1000ms
    Memory
    512MiB
    Difficulty
    10
    Tags
    # Submissions
    5
    Accepted
    3
    Uploaded By