Cod sursa(job #2441249)
| Utilizator | Data | 20 iulie 2019 10:42:14 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
#define maxn 5005
#define maxg 10005
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int p[maxn], w[maxn], rez[maxg],g,n;
int main()
{
cin>>n>>g;
for(int i=1; i<=n; i++)
cin>>w[i]>>p[i];
for(int i=1; i<=n; i++)
for(int j=g; j>=1; j--){
if(w[i]<=j)
rez[j]=max(rez[j],rez[j-w[i]]+p[i]);
}
cout<<rez[g];
return 0;
}
