Cod sursa(job #1593017)
Utilizator | Data | 8 februarie 2016 11:12:58 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int c[10005],i,n,m,rez,a,b;
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++)
{
f>>a>>b;
for(int j=m;j>=a;j--)
c[j]=max(c[j],c[j-a]+b);
}
for(int i=m;i>=1;i--)
if(c[i]>rez) rez=c[i];
g<<rez;
return 0;
}