Cod sursa(job #1954058)
Utilizator | Data | 5 aprilie 2017 10:23:06 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include<fstream>
using namespace std;
int n,g,i,j,s[10005],w[5005],p[5005],maxim;
int main()
{
ifstream in("rucsac.in");
ofstream out("rucsac.out");
in>>n>>g;
for(i=1;i<=n;i++)
{
in>>w[i]>>p[i];
for(j=g;j>=w[i];j--)
{
s[j]=max(s[j-w[i]]+p[i],s[j]);
if(s[j]>maxim)
maxim=s[j];
}
}
out<<maxim;
}