Cod sursa(job #1377329)
| Utilizator | Data | 5 martie 2015 21:12:31 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
int a[100001], b[50001], c[50001], ok, m, n, i, p, q, sol;
int main()
{
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
fin>>n>>m;
for(i=1; i<=n; i++)
{
fin>>b[i]>>c[i];
}
a[0]=0;
for(i=1; i<=n; i++)
{
for(q=m-b[i]; q>=0; q--)
{
if(a[q+b[i]]<a[q]+c[i]) a[q+b[i]]=a[q]+c[i];
if(a[q+b[i]]>sol) sol=a[q+b[i]];
}
}
fout<<sol;
return 0;
}
