Cod sursa(job #2935924)
| Utilizator | Data | 7 noiembrie 2022 18:14:48 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#include <algorithm>
#include <cmath>
#include <cstring>
using namespace std;
ifstream cin("rucsac.in") ;
ofstream cout("rucsac.out") ;
int n,v[5005],x[5005],profit[10005],m,i,j,g;
int main()
{
cin>>n>>g;
for(i=0;i<n;i++)
cin>>v[i]>>x[i];
for(i=1;i<=g;i++)
profit[i]=-1;
profit[0]=0;
for(i=0;i<n;i++)
for(j=g-v[i];j>=0;j--)
{
if(profit[j]!=-1&&profit[j]+x[i]>profit[j+v[i]])
profit[j+v[i]]=profit[j]+x[i];
}
sort(profit+1,profit+g+1);
cout<<profit[g];
return 0;
}
