Cod sursa(job #2479708)
Utilizator | Data | 24 octombrie 2019 12:23:43 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n,m,dp[10005],w[5005],p[5005];
int main() {
cin>>n>>m;
for(int i=1;i<=n;i++) {
cin>>w[i]>>p[i];
}
for(int i=1;i<=n;i++) {
for(int j=m;j>=1;j--) {
if (w[i]<=j )
dp[j]=max(dp[j],dp[j-w[i]]+p[i]);
}
}
cout<<dp[m];
return 0;
}