Cod sursa(job #2206838)
| Utilizator | Data | 23 mai 2018 22:10:55 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
int N, G, i, j, g, p, v[ 10005 ];
int main ()
{
fin>> N >> G;
for ( i = 1 ; i <= N ; i ++ )
{
fin>> g >> p;
for ( j = G ; j >= 0 ; j -- )
{
if ( j - g >= 0 && v[ j ] < v[ j - g ] + p )
{
v[ j ] = v[ j - g ] + p;
}
}
}
fout<< v[ G ];
}
