Cod sursa(job #1786049)
Utilizator | Data | 22 octombrie 2016 11:50:46 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int maxim=0;
int n, dp[1000];
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int gmax;
fin>>n>>gmax;
int g, v;
for(int i=1; i<=n; i++)
{
fin>>g>>v;
for(int j=gmax; j>=g; j--){
dp[j]=max(dp[j], dp[j-g]+v);
if(dp[j]>maxim)
maxim=dp[j];
}
}
fout<<maxim;
return 0;
}