Cod sursa(job #2862534)
Utilizator | Data | 5 martie 2022 14:52:38 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,m,i,x,y,j,M,a[10011];
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
{
f>>x>>y;
for(j=m-x;j>=0;j--)
{
a[j+x]=max(a[j+x],a[j]+y);
M=max(M,a[j+x]);
}
}
g<<M;
return 0;
}