Cod sursa(job #2505698)
Utilizator | Data | 7 decembrie 2019 10:29:47 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
using namespace std;
int N,G,a[10100];
int i,j,w,p;
int main()
{
ifstream f("rucsac.in");
ofstream g("rucsac.out");
f>>N>>G;
a[0]=1;
for (int i=0;i<N;i++)
{
f>>w>>p;
for (int j=G-w;j>=0;j--)
{
if(a[j]+p>a[j+w])
a[j+w]=a[j]+p;
}
}
p=0;
for (int i=0;i<=G;i++)
{
if (a[i]>p)
p=a[i];
}
g<<p-1;
return 0;
}