Cod sursa(job #1700412)
| Utilizator | Data | 10 mai 2016 14:44:52 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 65 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
#include<cmath>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,g;
int w[5001],p[5001];
long V[5001];
int rucsac()
{
int i,j;
for(i=1;i<=n;i++)
for(j=g;j>=w[i];j--)
V[j]=max(V[j],V[j-w[i]]+p[i]);
return V[g];
}
int main()
{
int i;
fin>>n>>g;
for(i=1;i<=n;i++)
fin>>w[i]>>p[i];
fout<<rucsac();
return 0;
}
