Cod sursa(job #2207729)
Utilizator | Data | 26 mai 2018 15:50:13 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
long long dp[10005];
int main()
{
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,G,x,p;
f>>n>>G;
for(int i=1;i<=n;i++)
{
f>>x>>p;
for(int j=G;j>=1;j--)
{
if(j>=x)
dp[j]=max(dp[j],dp[j-x]+p);
}
}
g<<dp[G];
return 0;
}