Cod sursa(job #2648173)
Utilizator | Data | 9 septembrie 2020 11:50:38 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,G,d[10001],x,y,ma;
int main()
{
f>>n>>G;
while(n--)
{
f>>x>>y;
for(int i=G-x; i>=0; --i)
{
if(d[i]+y>d[i+x])
{
d[i+x]=d[i]+y;
}
}
}
for(int i=1; i<=G; ++i)
{
if(d[i]>ma)
{
ma=d[i];
}
}
g<<ma;
return 0;
}