Cod sursa(job #1908075)
Utilizator | Data | 6 martie 2017 22:35:40 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
#define in "rucsac.in"
#define out "rucsac.out"
using namespace std;
ifstream fin(in);
ofstream fout(out);
int N,G,W,P;
int a[10003];
int main()
{
int i;
fin>>N>>G;
while(N--)
{
fin>>W>>P;
for(i=G;i>0;--i)
if(W<=i) a[i]=max(a[i],a[i-W]+P);
}
fout<<a[G]<<"\n";
fin.close();
fout.close();
return 0;
}