Cod sursa(job #2165374)
| Utilizator | Data | 13 martie 2018 12:00:50 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int v[10001];
int g,n;
int a[10001],p[10001];
void citire()
{
for(int i=1; i<=n; i++)
fin>>a[i]>>p[i];
}
int maxim(int c, int d)
{
if(c>d) return c;
else return d;
}
int rucsac()
{
for(int i=1; i<=n; i++)
for(int j=g; j>=a[i]; j--)
v[j]=maxim(v[j],v[j-a[i]]+p[i]);
return v[g];
}
int main()
{
fin>>n>>g;
citire();
fout<<rucsac();
return 0;
}
