Cod sursa(job #2085167)
Utilizator | Data | 9 decembrie 2017 19:39:55 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int gr[5005], c[5005], dp[10005];
int n, G;
int main()
{
in >> n >> G;
for(int i=1; i<=n; i++)
in >> gr[i] >> c[i];
for( int i=1; i<=n; i++)
for( int j = G; j>=gr[i]; j--)
if( gr[i] <=j)
dp[j] = max( dp[j], dp[j-gr[i]] + c[i]);
out << dp[G];
return 0;
}