Cod sursa(job #2557070)
| Utilizator | Data | 25 februarie 2020 14:47:05 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <algorithm>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,gmax,val[20001],t[20001],c[20001],i,j,mx,sol;
int main()
{
f>>n>>gmax;
for(i=1;i<=n;i++)
f>>t[i]>>c[i];
for(i=1;i<=n;i++)
for(j=mx;j>=0;j--)
if(val[j]+c[i]>val[j+t[i]] && j+t[i]<=gmax && (j==0 || val[j]))
{
val[j+t[i]]=val[j]+c[i];
if(j+t[i]>mx) mx=j+t[i];
}
for(i=0;i<=gmax;i++)
if(val[i]>sol) sol=val[i];
g<<sol;
}
