Cod sursa(job #1471590)
| Utilizator | Data | 14 august 2015 15:59:09 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 25 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int D[10010],W[5010],P[5010],i,j,n,Gtot;
int main()
{
fin>>n>>Gtot;
for( i = 1 ; i <= n ; i++ )
{
fin>>W[ i ]>>P[ i ];
}
for( i = 1 ; i <= n ; i++ )
{
for( j = Gtot - W[ i ] ; j > 0 ; j-- )
{
if( D[ j + W[ i ] ] < D[ j ] + P[ i ] )
{
D[ j + W[ i ] ] = D[ j ] + P[ i ];
}
}
}
fout<<D[ Gtot ];
return 0;
}
