Cod sursa(job #2155201)
Utilizator | Data | 7 martie 2018 18:00:33 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream in ("rucsac.in");
ofstream out ("rucsac.out");
int n,g,a[1005],cost[1005],val[1005];
int main()
{
int i,j;
in>>n>>g;
for(i=1;i<=n;i++)
in>>cost[i]>>val[i];
for(i=1;i<=n;i++)
for(j=g-cost[i];j>=0;j--)
if(val[i]+a[j]>a[j+cost[i]])
a[j+cost[i]]=val[i]+a[j];
out<<a[g];
return 0;
}