Cod sursa(job #2548757)
| Utilizator | Data | 16 februarie 2020 23:44:58 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#include <algorithm>
using namespace std;
struct obiect
{
int w,p;
}x[5005];
int m[10005][10005];
int main()
{
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int i,j,n,s;
f>>n>>s;
for(i=1;i<=n;i++)
{
f>>x[i].w>>x[i].p;
}
for(i=1;i<=n;i++)
{
for(j=1;j<=s;j++)
{
if(x[i].w>j)
{
m[i][j]=m[i-1][j];
}
else
{
m[i][j]=max(m[i-1][j],x[i].p+m[i-1][j-x[i].w]);
}
}
}
g<<m[n][s];
}
