Cod sursa(job #2683943)
Utilizator | Magnus MAGI333 | Data | 12 decembrie 2020 11:34:40 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream cin( "rucsac.in" );
ofstream cout( "rucsac.out" );
int n, maxx, g, val;
int dp[ 10005 ];
int main()
{
cin >> n >> maxx;
for( int i = 1; i <= n; i++ ){
cin >> g >> val;
for( int j = maxx; j >= g; j-- )
dp[ j ] = ( dp[ j ] > dp[ j - g ] + val ? dp[ j ] : dp[ j - g ] + val );
}
cout << dp[ maxx ];
return 0;
}