Cod sursa(job #1892698)
Utilizator | Data | 25 februarie 2017 11:02:50 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,c,i,x[10001],j,maxi;
struct dfg
{
int a,b;
}e[5001];
int main()
{fin>>n>>c;
for(i=1;i<=n;i++)
fin>>e[i].a>>e[i].b;
for(i=1;i<=c;i++)
x[i]=-1000000;
for(i=1;i<=n;i++)
for(j=c-e[i].a;j>=0;j--)
if(x[j]!=-1000000)
x[j+e[i].a]=max(x[j+e[i].a],x[j]+e[i].b);
for(i=0;i<=c;i++)
if(x[i]>maxi)
maxi=x[i];
fout<<maxi;
}