Cod sursa(job #3226987)
Utilizator | Data | 23 aprilie 2024 20:03:28 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <bits/stdc++.h>
using namespace std;
int dp[10001];
int main()
{
int n,w;
cin >> n >> w;
for(int i = 1;i<=n;i++){
int g,p;
cin >> g >> p;
for(int j = w;j>=0;j--){
if(j - g >= 0) dp[j] = max(dp[j],dp[j-g]+p);
}
}
cout << dp[w];
return 0;
}