Cod sursa(job #1543418)
Utilizator | Data | 6 decembrie 2015 10:55:01 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,g,w,p,D[10010],i,j;
int main()
{
fin>>n>>g;
for( i = 1 ; i <= n ; i++ )
{
fin>>w>>p;
for( j = g - w ; j >= 0 ; j-- )
{
if( D[ j + w ] < D[ j ] + p )
D[ j + w ] = D[ j ] + p;
}
}
fout<<D[g];
return 0;
}