Cod sursa(job #1290302)
Utilizator | Data | 11 decembrie 2014 05:31:10 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream x ("rucsac.in");
ofstream y ("rucsac.out");
struct produs
{
int g;
int p;
};
int n,g,v[10001];
produs a[5000];
int main()
{
int i,j;
x>>n>>g;
for(i=0;i<n;i++)
x>>a[i].g>>a[i].p;
for(i=0;i<n;i++)
for(j=g;j>=a[i].g;j--)
v[j]=max(v[j],v[j-a[i].g]+a[i].p);
y<<v[g]<<'\n';
return 0;
}