Cod sursa(job #3241550)
| Utilizator | Data | 31 august 2024 13:00:34 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream cin ("rucsac.in");
ofstream cout ("rucsac.out");
int v[5002],v2[5002],a[2][10002];
int main()
{
int n,g;
cin>>n>>g;
for(int i=1; i<=n; i++)
cin>>v[i]>>v2[i];
for(int i=1; i<=n; i++)
{
for(int j=1; j<=g; j++)
{
if(v[i]<=j && v2[i]+a[(i-1)%2][j-v[i]]>a[(i-1)%2][j])
a[i%2][j]=v2[i]+a[(i-1)%2][j-v[i]];
else
a[i%2][j]=a[(i-1)%2][j];
}
}
cout<<a[n%2][g];
return 0;
}
