Cod sursa(job #2738644)
Utilizator | Data | 6 aprilie 2021 10:20:52 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,lim,a[10001],b[10001],gr,p,i,j,maxi;
int main()
{
f>>n>>lim;
for(i=1;i<=n;i++)
{
f>>gr>>p;
if(p>a[gr])
b[gr]=p;
for(j=gr+1;j<=lim;j++)
if(a[j-gr])
if(a[j-gr]+p>a[j])
b[j]=a[j-gr]+p;
for(j=gr;j<=lim;j++)
{
a[j]=b[j];
if(b[j]>maxi)
maxi=b[j];
}
}
g<<maxi;
}