Mai intai trebuie sa te autentifici.
Cod sursa(job #1296271)
Utilizator | Data | 20 decembrie 2014 19:18:29 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.76 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
#define Dim 5001
#define Dim2 10001
int n, w;
int G[Dim], P[Dim];
int c[Dim2];
int cmax;
void Read();
void Knapsack();
int main()
{
Read();
Knapsack();
fout << cmax;
fin.close();
fout.close();
return 0;
}
void Knapsack()
{
cmax = 0;
c[0] = 0;
for ( int i = 1; i <= n; ++i )
for ( int j = w - G[i]; j >= 0; --j ) {
if ( c[j + G[i]] < c[j] + P[i] )
c[j + G[i]] = c[j] + P[i];
if ( c[j + G[i]] > cmax )
cmax = c[j + G[i]];
}
}
void Read()
{
fin >> n >> w;
for ( int i = 1; i <= n; ++i )
fin >> G[i] >> P[i];
}