Cod sursa(job #1900346)
Utilizator | Data | 3 martie 2017 12:18:29 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int w[5000],p[5000],pmaxn,G,i,m,s[100000],n,j;
int main()
{
f>>n>>G;
for(i=1;i<=n;i++)
f>>w[i]>>p[i];
for(i=1;i<=n;i++)
{
for(j=G;j>=w[i];j--)
s[j]=max(s[j],s[j-w[i]]+p[i]);
}
g<<s[G];
return 0;
}