Cod sursa(job #3239966)
Utilizator | Data | 9 august 2024 21:56:50 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int main()
{
int n, x, i, j, v[5001], c[5001], dp[10001]={0};
f>> n >> x;
for(i=1; i<=n; i++){
f>> c[i] >> v[i];
}
for(i=1; i<=n; i++){
for(j=x; j>=1; j--){
if(c[i]<=j){
dp[j]=max(dp[j], dp[j-c[i]]+v[i]);
}
}
}
g<< dp[x];
return 0;
}