4 solutions

  • 0
    @ 2026-5-10 14:53:01

    • @ 2026-5-10 14:58:25
      #include<bits/stdc++.h>
      using namespace std;
      const int N=1010,M=1010;
      int f[N][M],v[N],w[N];
      int main(){
      	int n,V;
      	cin>>n>>V;
      	for(int i=1;i<=n;i++){
      		cin>>v[i]>>w[i];
      	}
      	for(int i=1;i<=n;i++){
      		for(int j=0;j<=V;j++){
      			f[i][j]=f[i-1][j];
      			if(j>=v[i]){
      				f[i][j]=max(f[i][j],f[i][j-v[i]]+w[i]);
      			}
      		}
      	}
      	cout<<f[n][V];
      	return 0;
      }
      
      

Information

ID
989
Time
1000ms
Memory
256MiB
Difficulty
5
Tags
(None)
# Submissions
57
Accepted
23
Uploaded By