Cod sursa(job #1899862)
| Utilizator | Data | 2 martie 2017 23:08:14 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
const int N=5001,G=10001;
int g[N],p[N],pd[G];
int main()
{
int n,s,r=0;
in>>n>>s;
for(int i=1;i<=n;i++)
in>>g[i]>>p[i];
in.close();
pd[0]=0;
for(int i=1;i<=n;i++)
for(int j=s-g[i];j>=0;j--){
pd[j+g[i]]=max(pd[j+g[i]],pd[j]+p[i]);
r=max(r,pd[j+g[i]]);
}
out<<r<<"\n";
out.close();
return 0;
}
