Cod sursa(job #2093110)
Utilizator | Data | 22 decembrie 2017 22:54:50 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f ("rucsac.in");
ofstream g ("rucsac.out");
int n,usu,a,b,d[10003],k;
int main()
{
f>>n>>usu;
for(int i=1;i<=n;++i)
{
f>>a>>b;
for(int j=usu;j>=a;--j) d[j]=max(d[j],d[j-a]+b);
}
while(true)
{
if(d[usu])
{
g<<d[usu];
return 0;
}
--usu;
}
return 0;
}