Cod sursa(job #2467908)
Utilizator | Data | 5 octombrie 2019 10:40:06 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,w[10010],p[10010],dp[10010],pp;
int main()
{ f>>n>>pp;
for(int i=1;i<=n;i++) f>>w[i]>>p[i];
for(int i=1;i<=n;i++)
for(int j=pp;j>=w[i];j--)
dp[j]=max(dp[j],dp[j-w[i]]+p[i]);
g<<dp[pp];
g.close();
return 0;
}