Cod sursa(job #2092133)
Utilizator | Marin Vasile Peptenaru MarinPeptenaru | Data | 21 decembrie 2017 08:49:56 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
const int nx=5002;
const int gx=10002;
int n,gmax,g[nx],v[nx];
int smax[gx];
int main()
{
in>>n>>gmax;
for(int i=1; i<=n; i++)
in>>g[i]>>v[i];
for(int i=1; i<=n; i++)
for(int j=gmax-g[i]; j>=0; j--)
{
if(smax[j+g[i]]<smax[j]+v[i])
smax[j+g[i]]=smax[j]+v[i];
}
out<<smax[gmax];
return 0;
}