Cod sursa(job #2505783)
Utilizator | Data | 7 decembrie 2019 10:57:58 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n,k,p[5005],g[5005],x[10005];
int main()
{
fin>>n>>k;
for(int i=1;i<=n;i++)
fin>>g[i]>>p[i];
for(int i=1;i<=n;i++){
for(int j=k;j>0;j--){
if(j<g[i])
x[j]=x[j];
else
x[j]=max(x[j],x[j-g[i]]+p[i]);
}
}
fout<<x[k];
return 0;
}