Cod sursa(job #2569795)
Utilizator | Data | 4 martie 2020 13:43:19 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n,gm,d[10005],w[5005],p[5005],ans;
int main()
{
in>>n>>gm;
for(int i=1;i<=n;i++)
in>>w[i]>>p[i];
for(int i=1;i<=n;i++)
{
for(int j=gm;j-w[i]>=0;j--)
{
d[j]=max(d[j],d[j-w[i]]+p[i]);
ans=max(ans,d[j]);
}
}
out<<ans;
return 0;
}