Cod sursa(job #2470544)
| Utilizator | Data | 9 octombrie 2019 14:34:21 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int profit[10001],g[5001],p[5001];
int main()
{
int G,n,maxim=0;
cin>>n>>G;
for(int i=0;i<n;i++){
cin>>g[i]>>p[i];
}
for(int j=1;j<=G;j++){
profit[j]=-1;
}
for(int i=0;i<n;i++){
for(int j=G-g[i];j>=0;j--){
if(profit[j]!=-1 && profit[j]+p[i]>profit[j+g[i]]){
profit[j+g[i]]=profit[j]+p[i];
}
}
}
for(int i=1;i<=G;i++){
if(profit[i]>maxim){
maxim=profit[i];
}
}
cout<<maxim;
return 0;
}
