Cod sursa(job #1707973)
Utilizator | Data | 26 mai 2016 11:15:22 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream o("rucsac.out");
int n,g,i,j,v[10001],x,w,maxv;
int main(void)
{
f>>n>>g;
while (n--)
{
f>>w>>x;
for (i=g-w;i>=1;i--)
if (v[i] && v[i+w]<x+v[i]) v[i+w]=x+v[i];
if (w<=g && v[w]<x)
v[w]=x;
}
for (i=1;i<=g;i++)
if (v[i]>maxv) maxv=v[i];
o<<maxv<<"\n";
o.close();
}