Cod sursa(job #2505895)
Utilizator | Data | 7 decembrie 2019 11:39:27 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n,k,p,g,dp[10001];
int main()
{ in>>n>>k;
for(int i=1;i<=n;i++)
{ in>>g>>p;
for(int j=k;j>0;j--)
{ if(j<g)
dp[j]=dp[j];
else
dp[j]=max(dp[j],dp[j-g]+p);
}
}
out<<dp[k];
in.close();
out.close();
return 0;
}