Cod sursa(job #2540208)
Utilizator | Data | 6 februarie 2020 20:44:23 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int main() {
freopen("rucsac.in", "r", stdin);
freopen("rucsac.out", "w", stdout);
int n, gmax, a, b, dp[10001];
cin>>n>>gmax;
for(int i=0;i<n;i++){
cin>>a>>b;
for(int j=gmax;j>=a;j--)
if(dp[j-a]!=0)
dp[j] = max(dp[j], dp[j-a]+b);
dp[a] = max(b, dp[a]);
}
cout<<dp[gmax];
return 0;
}