Cod sursa(job #1224336)
Utilizator | Data | 30 august 2014 16:48:12 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int N, G, b[1000000], g1[10002], a[10002],i;
int main()
{
f>>N>>G;
for(i=1; i<=N; i++)
f>>g1[i]>>a[i];
int j;
for(i=1; i<=N; i++)
{
j=G;
while(j>=g1[i])
{
if(b[j-g1[i]] + a[i] > b[j]) b[j] = b[j-g1[i]] + a[i];
j--;
}
}
g<<b[G];
return 0;
}