Cod sursa(job #1540972)
Utilizator | Data | 3 decembrie 2015 16:36:18 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream p("rucsac.out");
long long r[100010],j,g,G,n,i,v;
int main()
{
f>>n>>G;
for(i=1;i<=n;i++)
{
f>>g>>v;
for(j=G;j>0;j--)
if(r[j]!=0)
{
if(j+g<=G && r[j+g]<r[j]+v)
r[j+g]=r[j]+v;
}
if(g<=G && r[g]<v)
r[g]=v;
}
i=G;
while(r[i]==0)
i--;
p<<r[i];
}