Cod sursa(job #2284125)
| Utilizator | Data | 16 noiembrie 2018 20:57:00 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.7 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
const int NMAX=10000;
int dp[NMAX+5];
int main()
{
int n, gmax, i, j, last, valmax, g, p;
fin>>n>>gmax;
for(i=1;i<=gmax;i++)
dp[i]=-1;
last=0;
valmax=0;
for(i=1;i<=n;i++)
{
fin>>g>>p;
for(j=last;j>=0;j--)
{
if(dp[j]!=-1)
{
if(j+g>gmax)
continue;
dp[j+g]=max(dp[j+g], dp[j]+p);
last=max(last, j+g);
valmax=max(valmax, dp[j+g]);
}
}
}
fout<<valmax<<"\n";
return 0;
}
